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

两种具有高鉴别能力的不规则性测度

Two Irregularity Measures Possessing High Discriminatory Ability

Akbar Ali, Tamás Réti

摘要:

度集恰好由$n-1$元素组成的$n$ -顶点图称为反正则图.这种类型的图通常被认为是与正则图相反的。连通图$G$的不规则性测度($IM$)是满足以下性质的非负图不变量:$IM(G) = 0$当且仅当$G$是正则的。图$G$的全不规则性定义为$irr_t(G)= \sum_{\{u,v\} \subseteq V(G)} |d_u - d_v|$,用$irr_t(G)$表示,其中$V(G)$是图$G$的顶点集,$d_u$,$d_v$分别表示$u$,$v$的度.根据不规则性度量$irr_t$,反正则图是最不规则的图;然而,各种非反正则图也是关于该不规则性度量的最不规则的图。在本说明中,设计了两种具有高区分能力的新的不规则性措施。根据所提出的测度,只有反正则图才是最不正则的图。

英文摘要:

An $n$-vertex graph whose degree set consists of exactly $n-1$ elements is called antiregular graph. Such type of graphs are usually considered opposite to the regular graphs. An irregularity measure ($IM$) of a connected graph $G$ is a non-negative graph invariant satisfying the property: $IM(G) = 0$ if and only if $G$ is regular. The total irregularity of a graph $G$, denoted by $irr_t(G)$, is defined as $irr_t(G)= \sum_{\{u,v\} \subseteq V(G)} |d_u - d_v|$ where $V(G)$ is the vertex set of $G$ and $d_u$, $d_v$ denote the degrees of the vertices $u$, $v$, respectively. Antiregular graphs are the most nonregular graphs according to the irregularity measure $irr_t$; however, various non-antiregular graphs are also the most nonregular graphs with respect to this irregularity measure. In this note, two new irregularity measures having high discriminatory ability are devised. Only antiregular graphs are the most nonregular graphs according to the proposed measures.

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

↑