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

图的最小全不正则性

The Minimal Total Irregularity of Graphs

Yingxue Zhu, Lihua You, Jieshan Yang

摘要:

在\cite{2012a}中,Abdo和Dimitov定义了图$G=(V,E)$的全不规则性为\hskip3.3cm $\rm irr_{t}$ $(G) = \frac{1}{2}\sum_{u,v\in V}|d_{G}(u)-d_{G}(v)|, $ \noindent,其中$d_{G}(u)$表示顶点$u\in V$的顶点度。本文研究了连通图的最小全不正则性,确定了树、单圈图、双圈图在$n$顶点上的最小、第二小、第三小全不正则性,并提出了一个有待进一步研究的公开问题.

英文摘要:

In \cite{2012a}, Abdo and Dimitov defined the total irregularity of a graph $G=(V,E)$ as \hskip3.3cm $\rm irr_{t}$$(G) = \frac{1}{2}\sum_{u,v\in V}|d_{G}(u)-d_{G}(v)|, $ \noindent where $d_{G}(u)$ denotes the vertex degree of a vertex $u\in V$. In this paper, we investigate the minimal total irregularity of the connected graphs, determine the minimal, the second minimal, the third minimal total irregularity of trees, unicyclic graphs, bicyclic graphs on $n$ vertices, and propose an open problem for further research.

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

↑