The Laplacian eigenvalues of mixed graphs (Q1863571): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalized matrix tree theorem for mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge version of the matrix tree theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge chromatic number of a directed/mixed multigraph / 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 note on Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An always nontrivial upper bound for Laplacian graph eigenvalues / rank
 
Normal rank

Latest revision as of 12:38, 5 June 2024

scientific article
Language Label Description Also known as
English
The Laplacian eigenvalues of mixed graphs
scientific article

    Statements

    The Laplacian eigenvalues of mixed graphs (English)
    0 references
    0 references
    0 references
    11 March 2003
    0 references
    The first part of the paper gives an upper bound for the second smallest Laplacian eigenvalue of the mixed graphs, thereby generalizing the results of \textit{M. Fiedler} [Czech. Math. J. 23, 298-305 (1973; Zbl 0265.05119)]. The second part presents two sharp upper bounds for the largest Laplacian eigenvalues of the mixed graphs in terms of the largest, smallest degrees and average 2-degrees, thereby improving and generalizing the main results of \textit{R. Merris} [Linear Algbra Appl. 285, 33-35 (1998; Zbl 0931.05053)], and \textit{J. Li} and \textit{Y. Pan} [Linear Algebra Appl. 328, 153-160 (2001; Zbl 0988.05062)].
    0 references
    0 references
    vertex connectivity
    0 references

    Identifiers