On K₁,3-free strictly Deza graphs

DOI10.1134/S0081543817050169MaRDI QIDQ1675327zbMATH OpenOpenAlexFDO

Authors Anastasiya Vladimirovna Mityanina

Publication date 27 October 2017

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0081543817050169

zbMATH Keywords

\(K_{1,3}\)-free graphsstrictly Deza graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
• Claw-free strictly Deza graphs
• Enumeration of strictly Deza graphs with at most 21 vertices
• Strictly Deza line graphs
• On Deza graphs with disconnected second neighborhood of a vertex

Cites work

• Deza graphs: A generalization of strongly regular graph
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)

Cited in

(8)

• On Deza graphs with disconnected second neighborhood of a vertex
• Enumeration of strictly Deza graphs with at most 21 vertices
• On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
• The structure of \(\{ K_{1,3},Z_2\}\)-free graphs
• scientific article; zbMATH DE number 5139441 (Why is no real title available?)
• Strictly Deza line graphs
• Deza graphs with parameters (n,k,k-1,a) and =1
• On Deza graphs with triangular and lattice graph complements as parameters

This page was built for publication: On \(K_{1,3}\)-free strictly Deza graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675327)