arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.18522math.CO
收藏

关于具有给定阶数和分离数的图的$A_α$-指标

On the $A_α$-index of graphs with given order and dissociation number

Zihan Zhou, Shuchao Li

AI总结:

本文研究了在给定阶数和分离数条件下图的$A_α$-指标极值问题,确定了具有最大和最小$A_α$-指标的连通图、二部图及树的结构。

摘要:

给定图$G$,若一个顶点子集所导出的子图中顶点度数至多为1,且该子集具有最大基数,则称之为$G$的最大分离集。最大分离集的基数称为$G$的分离数。$G$的邻接矩阵和度对角矩阵分别记为$A(G)$和$D(G)$。2017年,Nikiforov提出了$A_α$-矩阵:$A_α(G)=αD(G)+(1-α)A(G)$,其中$α\in[0,1]$。该新矩阵的最大特征值称为$G$的$A_α$-指标。本文首先在所有具有固定阶数和分离数的连通图(相应地,二部图、树)中,确定了具有最大$A_α$-指标的连通图(相应地,二部图、树)。其次,我们刻画了所有分离数为$τ$(其中$τ\geqslant\lceil\frac{2}{3}n\rceil$)且具有最小$A_α$-指标的$n$阶图的结构。最后,我们确定了所有分离数为$τ\in\{2,\lceil\frac{2}{3}n\rceil,n-1,n-2\}$且具有最小$A_α$-指标的$n$阶连通图。

英文摘要:

Given a graph $G,$ a subset of vertices is called a maximum dissociation set of $G$ if it induces a subgraph with vertex degree at most 1, and the subset has maximum cardinality. The cardinality of a maximum dissociation set is called the dissociation number of $G$. The adjacency matrix and the degree diagonal matrix of $G$ are denoted by $A(G)$ and $D(G),$ respectively. In 2017, Nikiforov proposed the $A_α$-matrix: $A_α(G)=αD(G)+(1-α)A(G),$ where $α\in[0,1].$ The largest eigenvalue of this novel matrix is called the $A_α$-index of $G.$ In this paper, we firstly determine the connected graph (resp. bipartite graph, tree) having the largest $A_α$-index over all connected graphs (resp. bipartite graphs, trees) with fixed order and dissociation number. Secondly, we describe the structure of all the $n$-vertex graphs having the minimum $A_α$-index with dissociation number $τ$, where $τ\geqslant\lceil\frac{2}{3}n\rceil.$ Finally, we identify all the connected $n$-vertex graphs with dissociation number $τ\in\{2,\lceil\frac{2}{3}n\rceil,n-1,n-2\}$ having the minimum $A_α$-index.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑