Binary representations of regular graphs (Q666512): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161502
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ionin, Yury J. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2011/101928 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005265601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Euclidean representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5468889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5818996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Regular Graphs Derived from Combinatorial Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank

Latest revision as of 23:07, 4 July 2024

scientific article
Language Label Description Also known as
English
Binary representations of regular graphs
scientific article

    Statements

    Binary representations of regular graphs (English)
    0 references
    8 March 2012
    0 references
    Summary: For any 2-distance set \(X\) in the \(n\)-dimensional binary Hamming space \(H_n\), let \(\Gamma_X\) be the graph with \(X\) as the vertex set and with two vertices adjacent if and only if the distance between them is the smaller of the two nonzero distances in \(X\). The binary spherical representation number of a graph \(\Gamma\), or \(\text{bsr}(\Gamma)\), is the least \(n\) such that \(\Gamma\) is isomorphic to \(\Gamma_X\), where \(X\) is a 2-distance set lying on a sphere in \(H_n\). It is shown that if \(\Gamma\) is a connected regular graph, then \(\text{bsr}(\Gamma) \geq b - m\), where \(b\) is the order of \(\Gamma\) and \(m\) is the multiplicity of the least eigenvalue of \(\Gamma\), and the case of equality is characterized. In particular, if \(\Gamma\) is a connected strongly regular graph, then \(\text{bsr}(\Gamma) = b - m\) if and only if \(\Gamma\) is the block graph of a quasisymmetric 2-design. It is also shown that if a connected regular graph is cospectral with a line graph and has the same binary spherical representation number as this line graph, then it is a line graph.
    0 references
    \(n\)-dimensional binary Hamming space
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references