Maximum principal ratio of the signless Laplacian of graphs

DOI10.1016/J.LAA.2022.08.026MaRDI QIDQ2676752zbMATH OpenOpenAlexWikidataFDO

Authors Lele Liu, S.-M. Hu, Changxiang He

Publication date 28 September 2022

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

Full work available at URL https://arxiv.org/abs/2204.04650

zbMATH Keywords

kite graphprincipal ratiosignless Laplacian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: Let $G$ be a connected graph and $Q(G)$ be the signless Laplacian of $G$. The principal ratio $gamma(G)$ of $Q(G)$ is the ratio of the maximum and minimum entries of the Perron vector of $Q(G)$. In this paper, we consider the maximum principal ratio $gamma(G)$ among all connected graphs of order $n$, and show that for sufficiently large $n$ the extremal graph is a kite graph obtained by identifying an end vertex of a path to any vertex of a complete graph.

Recommendations

• Graphs with maximal signless Laplacian spectral radius
• Maxima of the signless Laplacian spectral radius for planar graphs
• The maximum principal ratio of graphs
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• On maximum degree (signless) Laplacian matrix of a graph
• Graphs with maximum Laplacian and signless Laplacian Estrada index
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• On maximum signless Laplacian Estrada index of graphs with given parameters
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
• On the maximum signless Laplacian spectral radius of bipartite graphs.

Cites work

• Bounds for the Greatest Latent Root of a Positive Matrix
• Characterizing graphs of maximum principal ratio
• Eigenvectors and eigenvalues of non-regular graphs
• Graph theory
• Note on the Fundamental Theorem on Irreducible Non-Negative Matrices
• Principal eigenvectors of irregular graphs
• Revisiting two classical results on graph spectra

Cited in

(2)

• Characterizing graphs of maximum principal ratio
• The maximum principal ratio of graphs

This page was built for publication: Maximum principal ratio of the signless Laplacian of graphs

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