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

Randic指数关于最小和最大程度的变化

The variation of the Randic index with regard to minimum and maximum degree

Milica Milivojevic, Ljiljana Pavlovic

摘要:

图$G$的Randić指数$ R'(G) $的变化定义为\ $R(G) = \sum_{uv \in E(G)}\frac 1{\max \{d(u) d(v)\}}$,其中$d(u)$是顶点$u$的度,并且求和扩展到$G$的所有边$uv$。设$G(k,n)$是具有最小顶点度$k$的连通简单$n$ -顶点图的集合.本文在$G(k,n)$图中发现了Randić指数的变化达到最小值的图.当$k \leq \frac n2$时,极图是完全分裂图$K_{k,n-k}^*$,它只有两个度的顶点,即度$k$和度$n-1$,度$k$的顶点数为$n-k$,度$n-1$的顶点数为$k$ .对于$k \geq \frac n2$,极图也有二度顶点$k$和$n-1$,度$k$的顶点数为$\frac n2$。进一步推广了给定最大度的图的结果。

英文摘要:

The variation of the Randić index $ R'(G) $ of a graph $G$ is defined by\ $R(G) = \sum_{uv \in E(G)}\frac 1{\max \{d(u) d(v)\}}$, where $d(u)$ is the degree of vertex $u$ and the summation extends over all edges $uv$ of $G$. Let $G(k,n)$ be the set of connected simple $n$-vertex graphs with minimum vertex degree $k$. In this paper we found in $G(k,n)$ graphs for which the variation of the Randić index attains its minimum value. When $k \leq \frac n2$ the extremal graphs are complete split graphs $K_{k,n-k}^*$, which only vertices of two degrees, i.e. degree $k$ and degree $n-1$, and the number of vertices of degree $k$ is $n-k$, while the number of vertices of degree $n-1$ is $k$. For $k \geq \frac n2$ the extremal graphs have also vertices of two degrees $k$ and $n-1$, and the number of vertices of degree $k$ is $\frac n2$. Further, we generalized results for graphs with given maximum degree.

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

↑