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

关于图的群边不规则强度的注记

Note on the group edge irregularity strength of graphs

Marcin Anholcer, Sylwia Cichacz

摘要:

本文研究图的\textit{edge group irregularity strength}($es_g(G)$),即$s$的最小值,使得取任意一个阶为$s$的阿贝尔群$\mathcal{G}$,存在一个函数$f:V(G)\rightarrow \mathcal{G}$,使得在每条边上的顶点标号和是不同的.本文给出了$es_g(G)$、边不规则强度$es(G)$和调和序$\rm{har}(G)$的上界。

英文摘要:

We investigate the \textit{edge group irregularity strength} ($es_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\mathcal{G}$ of order $s$, there exists a function $f:V(G)\rightarrow \mathcal{G}$ such that the sums of vertex labels at every edge are distinct. In this note we provide some upper bounds on $es_g(G)$ as well as for edge irregularity strength $es(G)$ and harmonious order $\rm{har}(G)$.

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

↑