Email this article On K1,3-free strictly Deza graphs
- Authors: Mityanina A.V.1
-
Affiliations:
- Chelyabinsk State University
- Issue: Vol 297, No Suppl 1 (2017)
- Pages: 159-162
- Section: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/174808
- DOI: https://doi.org/10.1134/S0081543817050169
- ID: 174808
Cite item
Open Access
Access granted
Subscription Access
Abstract
A graph on v vertices is called a Deza graph with parameters (v, k, b, a) if it is k-regular and the number of common neighbors of two distinct vertices takes on one of two values. We describe strictly Deza graphs that do not contain K1,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 the them.
Keywords
About the authors
A. V. Mityanina
Chelyabinsk State University
Author for correspondence.
Email: nastya.mityanina@gmail.com
Russian Federation, Chelyabinsk, 454001
Supplementary files
