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

关于图的全局圈度指标的进一步结果

Further results on the global cyclicity index of graphs

Yujun Yang

摘要:

Klein和Ivanciuc从电网络理论的数学概念出发,引入并研究了一种新的图论循环性指数--全局循环性指数(Graph cyclicity,excess conductance,and resistance deficit,J.Math.Chem.30(2001)271- 287)。本文利用图论、电网络理论和实分析的技巧,得到了关于这个新的周期性测度的一些进一步的结果,包括严格单调增加性质、上下界和Nordhuas-Gaddum型结果.特别地,我们建立了具有$n$顶点和$m$边的连通图$G$的全局圈度指数$C(G)$与圈数$μ(G)$之间的关系:$$\frac{m}{n-1}μ(G)\leq C(G)\leq \frac{n}{2}μ(G).$$

英文摘要:

Being motivated in terms of mathematical concepts from the theory of electrical networks, Klein & Ivanciuc introduced and studied a new graph-theoretic cyclicity index--the global cyclicity index (Graph cyclicity, excess conductance, and resistance deficit, J. Math. Chem. 30 (2001) 271--287). In this paper, by utilizing techniques from graph theory, electrical network theory and real analysis, we obtain some further results on this new cyclicity measure, including the strictly monotone increasing property, some lower and upper bounds, and some Nordhuas-Gaddum-type results. In particular, we establish a relationship between the global cyclicity index $C(G)$ and the cyclomatic number $μ(G)$ of a connected graph $G$ with $n$ vertices and $m$ edges: $$\frac{m}{n-1}μ(G)\leq C(G)\leq \frac{n}{2}μ(G).$$

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

↑