arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.2569math.CO
收藏

连通图的群不规则强度

Group Irregularity Strength of Connected Graphs

Marcin Anholcer, Sylwia Cichacz, Martin Milanic

摘要:

本文研究了图的群无规强度($s_g(G)$),即$s$的最小值,使得取任意一个$s$阶的阿贝尔群$\gr$,存在一个函数$f:E(G)\rightarrow \gr$,使得每个顶点的边标号和是不同的.证明了对于任意阶数至少为3的连通图$G$,$s_g(G)=n$当$n\neq 4k+2$,$s_g(G)\leq n+1$当$s_g(G)\leq n+1$,除某些无限族星的情形外.

英文摘要:

We investigate the group irregularity strength ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge labels at every vertex are distinct. We prove that for any connected graph $G$ of order at least 3, $s_g(G)=n$ if $n\neq 4k+2$ and $s_g(G)\leq n+1$ otherwise, except the case of some infinite family of stars.

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

↑