On K1,3-free strictly Deza graphs

On K1,3-free strictly Deza graphs

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 K 1,3 among their induced subgraphs and are unions of closed ne...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the Steklov Institute of Mathematics Vol. 297; no. Suppl 1; pp. 159 - 162
Main Author: Mityanina, A. V.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 2017
Subjects:
Mathematics
Mathematics and Statistics
free graphs
strictly Deza graphs
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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 the them.
ISSN:0081-5438
1531-8605
DOI:10.1134/S0081543817050169