关于度界的图的不规则性
IF 0.7
4区 数学
Q2 MATHEMATICS
引用次数: 0
摘要
Albertson将图形$G$的不规则性定义为$$irr(G)=\sum\limits_{uv\in E(G)}|d_G(u)-d_G(v)|.$$对于具有$n$顶点、$m$边、最大度数$\Delta$和$d=\left\lfloor \frac{\Delta m}{\Delta n-m}\right\rfloor$的图形$G$，我们显示 $$irr(G)\leq d(d+1)n+\frac{1}{\Delta}\left(\Delta^2-(2d+1)\Delta-d^2-d\right)m.$$本文章由计算机程序翻译，如有差异，请以英文原文为准。
Irregularity of Graphs Respecting Degree Bounds
Albertson defined the irregularity of a graph $G$ as $$irr(G)=\sum\limits_{uv\in E(G)}|d_G(u)-d_G(v)|.$$ For a graph $G$ with $n$ vertices, $m$ edges, maximum degree $\Delta$, and $d=\left\lfloor \frac{\Delta m}{\Delta n-m}\right\rfloor$, we show $$irr(G)\leq d(d+1)n+\frac{1}{\Delta}\left(\Delta^2-(2d+1)\Delta-d^2-d\right)m.$$
求助全文
通过发布文献求助，成功后即可免费获取论文全文。
去求助
来源期刊
CiteScore
1.30
自引率
14.30%
发文量
212
审稿时长
3-6 weeks
期刊介绍：
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
