Binary representations of regular graphs

DOI10.1155/2011/101928zbMath1236.05135OpenAlexW2005265601WikidataQ58655885 ScholiaQ58655885MaRDI QIDQ666512

Ionin, Yury J.

Publication date: 8 March 2012

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/101928

zbMATH Keywords

\(n\)-dimensional binary Hamming space

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Conditions for the parameters of the block graph of quasi-symmetric designs

Cites Work

• Signless Laplacians of finite graphs
• Minimal Euclidean representations of graphs
• Which graphs are determined by their spectrum?
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Strongly Regular Graphs Derived from Combinatorial Designs
• Characterizations of derived graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Binary representations of regular graphs