新疆师范大学学报（自然科学版）2024，Vol.43Issue(3)：64-68,5.
给定点连通度的图的补图的无符号拉普拉斯谱半径
The Signless Laplacian Spectral Radius of the Complements of Graphs with Given Vertex Connectivity
摘要
Abstract
Suppose that G is a connected simple graph with the vertex set V(G)={v1,v2,⋯,vn}and the edge set E(G),the matrix Q(G)=D(G)+A(G)is called the signless Laplacian matrix of the graph G,where D(G)and A(G)are the degree diagonal matrix and the adjacency matrix of G,respectively,the maximum eigenvalue of matrix Q(G)is called the signless Laplacian spectral radius of graph G,the complements of G are denoted by Gc=(V(Gc),E(Gc)),where V(Gc)=V(G)and E(Gc)={xy|x,y ∈ V(G),xy ∉ E(G)}.In this paper,we the unique graph is determined that whose signless Laplacian spectral radius is minimum among all complements of graphs with given vertex connectivity and diameter greater than three.关键词
无符号拉普拉斯矩阵/无符号拉普拉斯谱半径/补图/点连通度Key words
Signless Laplacian matrix/Signless Laplacian spectral radius/Complements of graphs/Vertex connectivity分类
数理科学引用本文复制引用
李铿,邱欢,张维娟,王国平..给定点连通度的图的补图的无符号拉普拉斯谱半径[J].新疆师范大学学报（自然科学版）,2024,43(3):64-68,5.基金项目
新疆维吾尔自治区自然科学基金资助项目(2023D01A38). （2023D01A38）
