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

具有给定边连通度的图的匹配能量

The matching energy of graphs with given edge connectivity

Shengjin Ji, Hongping Ma

摘要:

设G是阶为$n$的简单图,$μ_1,μ_2,\ldots,μ_n$是其匹配多项式的根. $G$的匹配能量定义为$\sum_{i=1}^n|μ_i|$之和。令$K_{n-1,1}^k$是通过在$V(K_1)$和$V(K_{n-1})$之间添加$k$边而从$K_1\cup K_{n-1}$获得的图。本文证明了$K_{n-1,1}^k$在具有序$n$和边连通度$k$的所有连通图中具有最大匹配能量.

英文摘要:

Let G be a simple graph of order $n$ and $μ_1,μ_2,\ldots,μ_n$ the roots of its matching polynomial. The matching energy of $G$ is defined as the sum $\sum_{i=1}^n|μ_i|$. Let $K_{n-1,1}^k$ be the graph obtained from $K_1\cup K_{n-1}$ by adding $k$ edges between $V(K_1)$ and $V(K_{n-1})$. In this paper, we show that $K_{n-1,1}^k$ has maximum matching energy among all connected graph with order $n$ and edge connectivity $k$.

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

↑