Graphs with constant \(\mu\) and \(\overline{\mu}\) (Q1379987): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3686719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with four eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Hadamard matrices and related designs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular two-graphs on 36 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square λ-Linked Designs / rank
 
Normal rank

Revision as of 10:13, 28 May 2024

scientific article
Language Label Description Also known as
English
Graphs with constant \(\mu\) and \(\overline{\mu}\)
scientific article

    Statements

    Graphs with constant \(\mu\) and \(\overline{\mu}\) (English)
    0 references
    0 references
    0 references
    24 March 1998
    0 references
    A graph has constants \(\mu\) and \(\overline\mu\) if any two nonadjacent vertices have \(\mu\) common neighbours and any two adjacent vertices are both nonadjacent to \(\overline\mu\) vertices. It is proved that a connected graph \(G\) has constants \(\mu\) and \(\overline\mu\) if and only if the Laplacian of \(G\) has two distinct nonzero eigenvalues. Some constructions of such graphs are given.
    0 references
    Laplacian
    0 references
    eigenvalues
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references