Binary representations of regular graphs

DOI10.1155/2011/101928MaRDI QIDQ666512zbMATH OpenOpenAlexWikidataFDO

Authors Yury J. Ionin

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)

Recommendations

• Binary codes of strongly regular graphs
• A geometrical characterization of strongly regular graphs
• scientific article; zbMATH DE number 2187681
• Graph representations, two-distance sets, and equiangular lines
• scientific article; zbMATH DE number 782048

Cites work

• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3080144 (Why is no real title available?)
• Characterizations of derived graphs
• Combinatorics of symmetric designs
• Minimal Euclidean representations of graphs
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Signless Laplacians of finite graphs
• Strongly Regular Graphs Derived from Combinatorial Designs
• Which graphs are determined by their spectrum?

Cited in

(2)

• scientific article; zbMATH DE number 5999572 (Why is no real title available?)
• Conditions for the parameters of the block graph of quasi-symmetric designs

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

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