Strictly Deza line graphs
Vladislav Vladimirovich Kabanov, A. V. Mityanina · Proceedings of the Steklov Institute of Mathematics · 2014
For a given graph G , its line graph L ( G ) is defined as the graph with vertex set equal to the edge set of G in which 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 on υ vertices is called a strictly Deza graph with parameters ( υ, k, b, a ) if it is not strongly regular and any two vertices have a or b common neighbors. We give a classification of strictly Deza line graphs.