|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2016, Volume 22, Number 1, Pages 231–234
(Mi timm1274)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On $K_{1,3}$-free strictly Deza graphs
A. V. Mityanina Chelyabinsk State University
Abstract:
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.
Received: 05.12.2014
Citation:
A. V. Mityanina, “On $K_{1,3}$-free strictly Deza graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 22, no. 1, 2016, 231–234; Proc. Steklov Inst. Math. (Suppl.), 297, suppl. 1 (2017), 159–162
Linking options:
https://www.mathnet.ru/eng/timm1274 https://www.mathnet.ru/eng/timm/v22/i1/p231
|
Statistics & downloads: |
Abstract page: | 213 | Full-text PDF : | 52 | References: | 49 | First page: | 34 |
|