Geodesic
On $K_{1,3}$-free strictly Deza graphs
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 22 (2016) no. 1, pp. 231-234

Voir la notice de l'article provenant de la source Math-Net.Ru

A Deza graph with parameters $(v,k,b,a)$ is a $k$-regular graph with $v$ vertices where any two vertices have either $a$ or $b$ common neighbors. We describe strict Deza graphs that do not contain $K_{1,3}$ among their induced subgraphs and are unions of closed neighborhoods of two nonadjacent vertices. The latter condition means that there are two nonadjacent vertices such that any other vertex is adjacent to at least one of them.
Keywords: $K_{1,3}$-free graphs, strictly Deza graphs. 
@article{TIMM_2016_22_1_a20,
     author = {A. V. Mityanina},
     title = {On $K_{1,3}$-free strictly {Deza} graphs},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {231--234},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2016_22_1_a20/}
}
TY  - JOUR
AU  - A. V. Mityanina
TI  - On $K_{1,3}$-free strictly Deza graphs
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2016
SP  - 231
EP  - 234
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMM_2016_22_1_a20/
LA  - ru
ID  - TIMM_2016_22_1_a20
ER  - 
%0 Journal Article
%A A. V. Mityanina
%T On $K_{1,3}$-free strictly Deza graphs
%J Trudy Instituta matematiki i mehaniki
%D 2016
%P 231-234
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMM_2016_22_1_a20/
%G ru
%F TIMM_2016_22_1_a20
A. V. Mityanina. On $K_{1,3}$-free strictly Deza graphs. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 22 (2016) no. 1, pp. 231-234. http://geodesic.mathdoc.fr/item/TIMM_2016_22_1_a20/