On the Ky Fan k-norm of the LI-matrix of graphs
From MaRDI portal
Publication:5060664
Abstract: Let and be the adjacency matrix and the degree diagonal matrix of a graph , respectively. Then is called Laplacian matrix of the graph . Let be a graph with vertices and edges. Then the -matrix of are defined as , where is the identity matrix. In this paper, we are interested in extremal properties of the Ky Fan -norm of the -matrix of graphs, which is closely related to the well known problems and results in spectral graph theory, such as the Laplacian spectral radius, the Laplacian spread, the sum of the largest Laplacian eigenvalues, the Laplacian energy, and other parameters. Some bounds on the Ky Fan -norm of the -matrix of graphs are given, and the extremal graphs are partly characterized. In addition, upper and lower bounds on the Ky Fan -norm of -matrix of trees, unicyclic graphs and bicyclic graphs are determined, and the corresponding extremal graphs are characterized.
Recommendations
Cites work
- A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- A note on the upper bounds for the Laplacian spectral radius of graphs
- Beyond graph energy: norms of graphs and matrices
- Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
- Bounds for the Laplacian spectral radius of graphs
- Degree maximal graphs are Laplacian integral
- Extrema of graph eigenvalues
- Extremal norms of graphs and matrices
- Further developments on Brouwer's conjecture for the sum of Laplacian eigenvalues of graphs
- Graph energy
- scientific article; zbMATH DE number 5926156 (Why is no real title available?)
- scientific article; zbMATH DE number 500503 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Laplacian energy of a graph
- Laplacian matrices of graphs: A survey
- Maximum norms of graphs and matrices, and their complements
- Most Laplacian eigenvalues of a tree are small
- On Laplacian energy in terms of graph invariants
- On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
- On the Laplacian spectral radii of bicyclic graphs
- On the Laplacian spread of graphs
- On the lower bound of the sum of the algebraic connectivity of a graph and its complement
- On the signless Laplacian spectral radius of irregular graphs
- On the sum of \(k\) largest singular values of graphs and matrices
- On the sum of Laplacian eigenvalues of graphs
- On the sum of the Laplacian eigenvalues of a tree
- On the sum of the two largest Laplacian eigenvalues of trees
- On the sum of the two largest Laplacian eigenvalues of unicyclic graphs
- Ordering trees by their Laplacian spectral radii
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
- Spectra of graphs
- The Laplacian Spectrum of a Graph II
- The Laplacian spread of a tree
- The Laplacian spread of unicyclic graphs
- The largest eigenvalues of Laplacian matrices of unicyclic graphs
- The minimum Laplacian spread of unicyclic graphs
- The ordering of the connected graphs with the smallest Laplacian spectral radii
- The path is the tree with smallest greatest Laplacian eigenvalue
- Upper bounds for the sum of Laplacian eigenvalues of graphs
- Upper bounds on the Laplacian spread of graphs
This page was built for publication: On the Ky Fan $k$-norm of the $LI$-matrix of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060664)