Algebraic characterizations of graph regularity conditions

DOI10.1007/s10623-004-4857-4zbMath1055.05154OpenAlexW2057952162WikidataQ56113891 ScholiaQ56113891MaRDI QIDQ1766109

Curtin, Brian

Publication date: 28 February 2005

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-4857-4

zbMATH Keywords

distance-regular graphadjacency algebra

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (4)

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two ⋮ Alliance polynomial of regular graphs ⋮ 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs

Cites Work

• The girth of a thin distance-regular graph
• The subconstituent algebra of an association scheme. I
• Locally pseudo-distance-regular graphs
• On rank 3 permutation groups
• Homogeneous graphs and regular near polygons
• Algebraic characterizations of distance-regular graphs
• Almost 2-homogeneous bipartite distance-regular graphs
• 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
• On spin models, triply regular association schemes, and duality
• Distance-regularised graphs are distance-regular or distance-biregular
• On the Polynomial of a Graph
• On the algebraic theory of pseudo-distance-regularity around a set

This page was built for publication: Algebraic characterizations of graph regularity conditions