秩为6的二部图的谱半径  

Spectral radius of a bipartite graph with rank 6

作　　者：周玉 王龙 ZHOU Yu;WANG Long(School of Mathematics and Big Data,Anhui University of Science and Technology,Huainan 232001,China)

机构地区：[1]安徽理工大学数学与大数据学院,安徽淮南232001

出　　处：《哈尔滨商业大学学报（自然科学版）》2024年第6期698-701,共4页Journal of Harbin University of Commerce：Natural Sciences Edition

基　　金：安徽省自然科学基金项目(2308085MA02)。

摘　　要：设图G是有n个顶点的连通图且m=(m_(1),m_(2),…,m_(p))是一个正整数向量.谱半径ρ(G)是图G特征值的最大值,记作ρ(G)=max|λi|.图的谱半径和秩分别定义为其邻接矩阵的谱半径和秩.在谱极值图论中,确定谱半径最大或最小是一个重要的问题.最终找出秩为6的二部连通图中最大和最小谱半径的图.Let G is a connected graph with n vertices and m=(m_(1),m_(2),…,m_(p))is a positive integer vector.The spectral radiusρ(G)is the maximum value of the eigenvalue of the graph G,denoted asρ(G)=max|λi|.The spectral radius and rank of the graph were defined as the spectral radius and rank of its adjacency matrix,respectively.In the theory of spectral extremums,it was an important problem to determine the maximum or minimum spectral radius.This paper found out the plots of the maximum and minimum spectral radius in the bipartite connected graph with rank 6.

关 键 词：图秩 最大谱半径 最小谱半径 

分 类 号：O157.6[理学—数学]