Supported by the National Natural Science Foundation of China(Grant No.12171089);the Natural Science Foundation of Fujian Province(Grant No.2021J02048)。
Let G be simple graph with vertex set V and edge set E. In this paper, we establish an interlacing inequality between the A_(α) eigenvalues of G and its subgraph G-U,where U ? V. Moreover, as an application, this int...
Supported by the National Natural Science Foundation of China(Grant No.11171290);the Natural Science Foundation of Jiangsu Province(Grant No.BK20151295)
A connected graph G = (V, E) is called a quasi-tree graph, if there exists a vertex vo ∈ V(G) such that G - v0 is a tree. Liu and Lu [Linear Algebra Appl. 428 (2008) 2708- 2714] determined the maximal spectral ...
Supported by National Natural Science Foundation of China (Grant No.11301093);the Zhujiang Technology New Star Foundation of Guangzhou (Grant No.2011J2200090);Program on International Cooperation and Innovation,Department of Education,Guangdong Province (Grant No.2012gjhz0007)
Let G be a graph. The Hosoya index Z(G) of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent ...
Supported by the Scientific Research Fund of Hunan Provincial Education Department (Grant No. 11C0541)
Let G be a k(k ≤3)-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/(4 k)} of G,if,then G is up-embeddable.
Supported by the National Natural Science Foundation of China(Grant Nos.10871204;61170311);the Fundamental Research Funds for the Central Universities(Grant No.09CX04003A)
In this paper, we determine the unique graph with the largest signless Laplacian spectral radius among all the tricyclic graphs with n vertices and k pendant vertices.