Irregularity of Graphs Respecting Degree Bounds
arxiv（2023）
摘要
Albertson defined the irregularity of a graph G as irr(G) = Sigma(uv is an element of E(G)) |d(G)(u) - d(G) (upsilon)|. For a graph G with n vertices, m edges, maximum degree Delta, and d = [Delta m/Delta n-m], we show irr(G) <= d(d + 1)n + 1/Delta(Delta(2) - (2d + 1)Delta - d(2) - d) m.
更多查看译文
关键词
graphs,degree bounds
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要