The Laplacian eigenvalues of mixed graphs
type: Item
instance of: scholarly article
title: The Laplacian eigenvalues of mixed graphs
zbMATH Open document ID: 1017.05078
DOI: 10.1016/S0024-3795(02)00509-8
author: Rong Luo
author: Xiao-Dong Zhang
published in: Linear Algebra and its Applications
publication date: 2003-03-11T00:00:00Z
review text: 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)].
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1880067
zbMATH Keywords: vertex connectivity
MaRDI profile type: Publication
cites work: Generalized matrix tree theorem for mixed graphs
cites work: Edge version of the matrix tree theorem for trees
cites work: Q5682350
cites work: The Laplacian Spectrum of a Graph II
cites work: Matrix Analysis
cites work: de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
cites work: The edge chromatic number of a directed/mixed multigraph
cites work: Laplacian matrices of graphs: A survey
cites work: A note on Laplacian graph eigenvalues
cites work: Q4352274
cites work: An always nontrivial upper bound for Laplacian graph eigenvalues
description: scientific article; zbMATH DE number 1880067