On the Ky Fan kk-norm of the LILI-matrix of graphs

preprint2022arXivOpen access

Abstract

Let A(G)A(G) and D(G)D(G) be the adjacency matrix and the degree diagonal matrix of a graph GG, respectively. Then L(G)=D(G)−A(G)L(G)=D(G)-A(G) is called Laplacian matrix of the graph GG. Let GG be a graph with nn vertices and mm edges. Then the LILI-matrix of GG are defined as LI(G)=L(G)−2mnInLI(G)=L(G)-\frac{2m}{n}I_n, where InI_n is the identity matrix. In this paper, we are interested in extremal properties of the Ky Fan kk-norm of the LILI-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 kk largest Laplacian eigenvalues, the Laplacian energy, and other parameters. Some bounds on the Ky Fan kk-norm of the LILI-matrix of graphs are given, and the extremal graphs are partly characterized. In addition, upper and lower bounds on the Ky Fan kk-norm of LILI-matrix of trees, unicyclic graphs and bicyclic graphs are determined, and the corresponding extremal graphs are characterized.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.