Skip to main content
Log in

On graphs in which the intersection of neighborhoods of vertices from every 3-coclique is a clique

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. A. E. Brouwer, A. M. Cohen, A. Neumaier, Distance-Regular Graphs (Springer-Verlag, Berlin, 1989).

    MATH  Google Scholar 

  2. V. V. Kabanov, A. A. Makhnev, and D. V. Paduchikh, Mat. Zametki 74, 396–406 (2003).

    MathSciNet  Google Scholar 

  3. V. V. Kabanov, A. A. Makhnev, and D. V. Paduchikh, Tr. Ins. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk 14(4), 53–69 (2008).

    Google Scholar 

  4. A. A. Makhnev and D. V. Paduchikh, Izv. Akad. Nauk, Ser. Mat. 61(4), 67–80 (1997).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. A. Makhnev.

Additional information

Original Russian Text © A.L. Gavrilyuk, A.A. Makhnev, 2011, published in Doklady Akademii Nauk, 2011, Vol. 436, No. 1, pp. 7–10.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gavrilyuk, A.L., Makhnev, A.A. On graphs in which the intersection of neighborhoods of vertices from every 3-coclique is a clique. Dokl. Math. 83, 1–4 (2011). https://doi.org/10.1134/S1064562411010029

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562411010029

Keywords

Navigation