|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2012, Volume 18, Number 1, Pages 165–177
(Mi timm787)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Strictly Deza line graphs
V. V. Kabanovab, A. V. Mityaninac a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
b Ural Federal University
c Chelyabinsk State University
Abstract:
For a given graph $G$, its line graph $L(G)$ is a graph such that its vertices represent the edges of $G$ and two vertices are adjacent if and only if the corresponding edges of $G$ have exactly one common vertex. A $k$-regular graph of diameter 2 with $v$ vertices is called a strictly Deza graph with parameters $(v,k,b,a)$ if it is not strongly regular and any two vertices have either $a$ or $b$ common neighbors. We present a classification of strictly Deza graphs that are line graphs.
Keywords:
line graphs, strictly Deza graphs.
Received: 02.09.2011
Citation:
V. V. Kabanov, A. V. Mityanina, “Strictly Deza line graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 18, no. 1, 2012, 165–177; Proc. Steklov Inst. Math. (Suppl.), 285, suppl. 1 (2014), S78–S90
Linking options:
https://www.mathnet.ru/eng/timm787 https://www.mathnet.ru/eng/timm/v18/i1/p165
|
Statistics & downloads: |
Abstract page: | 536 | Full-text PDF : | 159 | References: | 66 | First page: | 11 |
|