Unoriented Laplacian maximizing graphs are degree maximal

DOI10.1016/J.LAA.2008.04.002zbMATH Open1149.05034OpenAlexW2038571023MaRDI QIDQ932145

Yizheng Fan, Jun Zhou, Bit-Shun Tam

Publication date: 10 July 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.04.002

zbMATH Keywords

spectral radiusdegree sequencePerron vectorthreshold graphmaximal graphmaximizingunoriented Laplacian matrixvicinal pre-order

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix Analysis
• Signless Laplacians of finite graphs
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Eigenspaces of graphs
• On the Laplacian Eigenvalues of Signed Graphs
• On the spectral radius of (0,1)-matrices
• Maximal graphs and graphs with maximal spectral radius
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Spektren endlicher Grafen
• Generalized matrix tree theorem for mixed graphs
• Degree maximal graphs are Laplacian integral
• On the maximal index of graphs with a prescribed number of edges
• The neighborhood inclusion structure of a graph
• Largest eigenvalue of a unicyclic mixed graphs
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• Spectral Integral Variations of Degree Maximal Graphs
• On Spectral Integral Variations of Graphs
• The polytope of degree sequences
• The Laplacian eigenvalues of mixed graphs
• The Laplacian spectrum of a mixed graph
• Threshold graphs
• The sharpness of a lower bound on the algebraic connectivity for maximal graphs

Cited In (26)

• Theorems on partitioned matrices revisited and their applications to graph spectra
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• A conjecture on the diameter and signless Laplacian index of graphs
• Some notes on the spectral perturbations of the signless Laplacian of a graph
• The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences
• Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
• The least signless Laplacian eignvalue of the complements of unicyclic graphs
• Graphs of fixed order and size with maximal \(A_\alpha\)-index
• Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
• The minimum signless Laplacian spectral radius of graphs with given independence number
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• Graphs with maximal signless Laplacian spectral radius
• On the signless Laplacian index of cacti with a given number of pendant vertices
• On the signless Laplacian index of unicyclic graphs with fixed diameter
• On the reduced signless Laplacian spectrum of a degree maximal graph
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• The signless Laplacian spread
• The least eigenvalue of signless Laplacian of graphs under perturbation
• Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
• The least eigenvalue of the signless Laplacian of the complements of trees
• Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
• The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
• The second least eigenvalue of the signless Laplacian of the complements of trees
• Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows

This page was built for publication: Unoriented Laplacian maximizing graphs are degree maximal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932145)