Binary representations of regular graphs

DOI10.1155/2011/101928zbMATH Open1236.05135OpenAlexW2005265601WikidataQ58655885 ScholiaQ58655885MaRDI QIDQ666512FDOQ666512

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

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

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)

Cites Work

• Signless Laplacians of finite 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
• Which graphs are determined by their spectrum?
• Title not available (Why is that?)
• Characterizations of derived graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorics of symmetric designs
• Strongly Regular Graphs Derived from Combinatorial Designs
• Minimal Euclidean representations of graphs

Cited In (2)

• Conditions for the parameters of the block graph of quasi-symmetric designs
• Title not available (Why is that?)

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)