ترغب بنشر مسار تعليمي؟ اضغط هنا

The quotients between the (revised) Szeged index and Wiener index of graphs

153   0   0.0 ( 0 )
 نشر من قبل Shuchao Li
 تاريخ النشر 2016
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $ngeqslant 10$ are characterized; as well the graphs with the first, second, third, and fourth largest Wiener indices among all bicyclic graphs are identified. Based on these results, further relation on the quotients between the (revised) Szeged index and the Wiener index are studied. Sharp lower bound on $Sz(G)/W(G)$ is determined for all connected graphs each of which contains at least one non-complete block. As well the connected graph with the second smallest value on $Sz^*(G)/W(G)$ is identified for $G$ containing at least one cycle.



قيم البحث

اقرأ أيضاً

The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. E. Czabarka, et al. conjectured that for an $n$-vertex, $ngeq 4$, simple quadrangulation graph $G$, begin{equation*}W(G)leq begin{cas es} frac{1}{12}n^3+frac{7}{6}n-2, &text{ $nequiv 0~(mod 2)$,} frac{1}{12}n^3+frac{11}{12}n-1, &text{ $nequiv 1~(mod 2)$}. end{cases} end{equation*} In this paper, we confirm this conjecture.
An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index ($textrm{sz}(G)$). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular, we proved t hat the star is a tree having the maximal $textrm{sz}(G)$. Finding a tree with the minimal $textrm{sz}(G)$ is not an easy task to be done. Here, we present the minimal trees up to 25 vertices obtained by computer and describe the regularities which retain in them. Our preliminary computer tests suggest that a tree with the minimal $textrm{sz}(G)$ is also the connected graph of the given order that attains the minimal weighted Szeged index. Additionally, it is proven that among the bipartite connected graphs the complete balanced bipartite graph $K_{leftlfloor n/2rightrfloorleftlceil n/2 rightrceil}$ attains the maximal $textrm{sz}(G)$,. We believe that the $K_{leftlfloor n/2rightrfloorleftlceil n/2 rightrceil}$ is a connected graph of given order that attains the maximum $textrm{sz}(G)$.
Let $G$ be a connected graph. The edge revised Szeged index of $G$ is defined as $Sz^{ast}_{e}(G)=sumlimits_{e=uvin E(G)}(m_{u}(e|G)+frac{m_{0}(e|G)}{2})(m_{v}(e|G)+frac{m_{0}(e|G)}{2})$, where $m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is the number of edge s whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), and $m_{0}(e|G)$ is the number of edges equidistant from both ends of $e$. In this paper, we give the minimal and the second minimal edge revised Szeged index of cacti with order $n$ and $k$ cycles, and all the graphs that achieve the minimal and second minimal edge revised Szeged index are identified.
The edge Szeged index and edge-vertex Szeged index of a graph are defined as $Sz_{e}(G)=sumlimits_{uvin E(G)}m_{u}(uv|G)m_{v}(uv|G)$ and $Sz_{ev}(G)=frac{1}{2} sumlimits_{uv in E(G)}[n_{u}(uv|G)m_{v}(uv|G)+n_{v}(uv|G)m_{u}(uv|G)],$ respectively, wher e $m_{u}(uv|G)$ (resp., $m_{v}(uv|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), and $n_{u}(uv|G)$ (resp., $n_{v}(uv|G)$) is the number of vertices whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), respectively. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, the lower bounds of edge Szeged index and edge-vertex Szeged index for cacti with order $n$ and $k$ cycles are determined, and all the graphs that achieve the lower bounds are identified.
Weighted Szeged index is a recently introduced extension of the well-known Szeged index. In this paper, we present a new tool to analyze and characterize minimum weighted Szeged index trees. We exhibit the best trees with up to 81 vertices and use th is information, together with our results, to propose various conjectures on the structure of minimum weighted Szeged index trees.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا