Properties of spectra of graphs and line graphs (Q1847637): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s11766-002-0017-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5553120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the smallest eigenvalue of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11766-002-0017-7 / rank
 
Normal rank

Latest revision as of 10:15, 16 December 2024

scientific article
Language Label Description Also known as
English
Properties of spectra of graphs and line graphs
scientific article

    Statements

    Properties of spectra of graphs and line graphs (English)
    0 references
    0 references
    4 November 2003
    0 references
    Using the interlacing theorem for eigenvalues of real symmetric matrices several straightforward inequalities for eigenvalues of the following graph matrices are derived: the Laplacian matrix and a related matrix of a graph, and the adjacency matrix of the line graph of a graph.
    0 references
    interlacing theorem
    0 references
    eigenvalues
    0 references
    graph matrices
    0 references
    Laplacian matrix
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers