Non rank 3 strongly regular graphs with the 5-vertex condition

DOI10.1007/BF02125894zbMath0706.05056MaRDI QIDQ919012

Elsie Sterbin Gottlieb

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

graphstrongly regular graphs5-vertex conditiont-vertex condition

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

Galois correspondence between permutation groups and cellular rings (association schemes), On a family of highly regular graphs by Brouwer, Ivanov, and Klin, On highly regular strongly regular graphs, A criterion for the \(t\)-vertex condition of graphs, Strongly regular graphs with the \(7\)-vertex condition, Two families of strongly regular graphs with the 4-vertex condition, Constructing partial geometries from overlarge sets of Steiner systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new strongly regular graphs
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• PRIMITIVE AND IMPRIMITIVE GRAPHS