Graphs with a common eigenvalue deck (Q957997): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A graph polynomial and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2914004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of graphs of nullity one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial reconstruction and terminal vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial reconstruction of unicyclic graphs is unique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank

Latest revision as of 20:51, 28 June 2024

scientific article
Language Label Description Also known as
English
Graphs with a common eigenvalue deck
scientific article

    Statements

    Graphs with a common eigenvalue deck (English)
    0 references
    0 references
    2 December 2008
    0 references
    adjacency matrix
    0 references
    \(\mu \)-singular graph
    0 references
    \(\mu \)-eigenvectors
    0 references
    \(\mu \)-singular deck
    0 references
    \(\mu \)-core graph
    0 references
    \(\mu \)-nut graph
    0 references
    interlacing
    0 references
    reconstruction
    0 references

    Identifiers