Maximum principal ratio of the signless Laplacian of graphs

DOI10.1016/J.LAA.2022.08.026zbMATH Open1497.05153arXiv2204.04650OpenAlexW4223510861WikidataQ114151211 ScholiaQ114151211MaRDI QIDQ2676752FDOQ2676752

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)

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.

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

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.

zbMATH Keywords

signless Laplacianprincipal ratiokite graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• 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)