RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sib. Èlektron. Mat. Izv., 2017, Volume 14, Pages 367–387 (Mi semr789)  

Discrete mathematics and mathematical cybernetics

Claw-free strictly Deza graphs

V. V. Kabanova, A. V. Mityaninab

a Krasovskii Institute of Mathematics and Mechanics UB RAS, ul. S. Kovalevskoy, 16, 620990, Yekaterinburg, Russia
b Chelyabinsk State University, ul. Br. Kashirinyh, 129, 454000, Chelyabinsk, Russia

Abstract: A Deza graph with parameters $(v,k,b,a)$ is a $k$-regular graph, which has exactly $v$ vertices and any two distinct vertices have either $a$ or $b$ common neighbors. A strictly Deza graph is a Deza graph of diameter $2$ that is not strongly regular. A claw-free graph is a graph in which no induced subgraph is a complete bipartite graph $K_{1,3}$. We proved if graph $G$ is a claw-free strictly Deza graph which contains a $3$-coclique then $G$ is either an $4 \times n$-lattice, where $n > 2$, $n \neq 4$, or the $2$-extension of the $3 \times 3$-lattice, or two strictly Deza graphs with the parameters $(9,4,2,1)$, or two strictly Deza graphs with the parameters $(12,6,3,2)$, or a Deza line graph with the parameters $(20,6,2,1)$.

Keywords: strictly Deza graphs, claw-free graphs.

DOI: https://doi.org/10.17377/semi.2017.14.030

Full text: PDF file (493 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.172.4
MSC: 05C25
Received October 21, 2016, published April 6, 2017
Language:

Citation: V. V. Kabanov, A. V. Mityanina, “Claw-free strictly Deza graphs”, Sib. Èlektron. Mat. Izv., 14 (2017), 367–387

Citation in format AMSBIB
\Bibitem{KabMit17}
\by V.~V.~Kabanov, A.~V.~Mityanina
\paper Claw-free strictly Deza graphs
\jour Sib. \`Elektron. Mat. Izv.
\yr 2017
\vol 14
\pages 367--387
\mathnet{http://mi.mathnet.ru/semr789}
\crossref{https://doi.org/10.17377/semi.2017.14.030}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000407792200034}


Linking options:
  • http://mi.mathnet.ru/eng/semr789
  • http://mi.mathnet.ru/eng/semr/v14/p367

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:177
    Full text:45
    References:24

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021