WebLiu described the relations between Wiener polarity index, Zagreb index, Wiener index, and hyper-Wiener index in [ ]; they also determined there the rst two smallest Wiener polarity indices among all unicyclic graphs. Recently, Du et al. obtained the smallest and largest Wiener polarity indices togetherwith thecorrespondinggraphs amongalltreeswith WebA graph is unicyclic (or monocyclic) if it is connected and contains exactly one cycle. There is a rich literature on extremal problems regarding Wiener index on unicyclic graphs (for example, see [5, 13, 19, 22]). Section 4 of [21] is devoted to unicyclic graphs. Lin [17] studied the extreme Wiener index of trees with given number of even degree
Remarks on the Wiener index of unicyclic graphs SpringerLink
Web6 de abr. de 2024 · In the case of unicyclic graphs f(x) ... Mn – index, Hosoya … WebThe Wiener polarity index of a connected graph G is defined as the number of its pairs of vertices that are at distance three. By introducing some graph transformations, in different way with that of Huang et al., 2013, we determine the minimum Wiener polarity index of unicyclic graphs with any given maximum degree and girth, and characterize extremal … birdcage burton latimer
ON THE WIENER INDEX OF UNICYCLIC GRAPHS - DergiPark
WebThe maximum Wiener polarity index of unicyclic graphs [J]. Appl Math Comput, 2012, … Web16 de jan. de 2024 · The Wiener, Wiener polarity and the terminal Wiener indices are the distance based topological indices. In this paper, we described a linear time algorithm {\bf(LTA)} that computes the Wiener index for acyclic graphs and extended this algorithm for unicyclic graphs. WebSZEGED INDEX OF A CLASS OF UNICYCLIC GRAPHS 1141 Lemma 3 ([10,18]). Among the n-vertex trees with n 4, S0 n is the unique graph with the second smallest Wiener index, which is equal to n2 n 2, and P0 n is the unique graph with the second largest Wiener index, which is equal to 1 6.n 3 7nC18/. The following lemma may be easily … dalry auctions scotland