2024 On the wiener index of unicyclic graphs

On the wiener index of unicyclic graphs

Author: ztcq

August undefined, 2024

Web1 de set. de 1994 · Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs. Discrete Dynamics in Nature and Society 2024, 2024 , 1-14. https: ... The symmetry-moderated Wiener index of truncation graph, Thorn graph and Caterpillars. Discrete Applied Mathematics 2024, 269 , 41-51. https: ... WebThe Wiener index of a graph G is deﬁned as W(G) = P u,v dG(u,v), where dG(u,v) is …

Subtrees and independent subsets in unicyclic graphs and unicyclic ...

Web1 de dez. de 2024 · Case 2. At least one of vertices v i and v j is in C k (see Fig. 3).. … WebOur paper is organized as follows: In Section 2, we give necessary definitions and state … tempeh air fryer time

On the Wiener index of unicyclic graphs with given girth

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 Web1 de jun. de 2016 · The Wiener index is the sum of distances between all pairs of distinct … WebHá 1 dia · The revised edge Szeged index of is defined as , where (resp., ) is the number … tree trimming service burbank ca

On the Vertex-Degree-Function Indices of Connected (n, m) …

The maximum Wiener polarity index of unicyclic graphs

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. Web17 de out. de 2016 · The Wiener index is the sum of distances between all pairs of … tempeh and broccoli stir fryWebLet be the number of connected induced subgraphs in a graph , and the complement of . We prove that is minimum, among all -vertex graphs, if and only if has no induced path on four vertices. Since the -vertex star … tree trimming service clarksville tn

"Web26 de fev. de 2011 · Download a PDF of the paper titled The Wiener Index of Unicyclic Graphs with Girth and the Matching Number, by Ya-Hong Chen and Xiao-Dong Zhang Download PDF Abstract: In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. " - On the wiener index of unicyclic graphs

On the wiener index of unicyclic graphs

Bounds on the Vertex Co−PI Index of Trees and Unicyclic Graphs∗ ...

Web伊佳茹，雷英杰(中北大学理学院，太原 030051)给定直径的单圈图的Harary指数伊佳 … Web22 de jan. de 2024 · That is, among a certain class of graphs, the extremal graphs that maximize one index usually minimize the other, and vice versa. In this paper, we first study the numbers of subtrees in unicyclic graphs and unicyclic graphs with a given girth, further confirming its opposite behavior to the Wiener index by comparing with known …

Did you know?

WebThe Wiener index of a graph G is defined as W (G) = ∑ u,v dG(u, v), where dG(u, v) is … Web9 de mar. de 2024 · Molecular trees and unicyclic graphs are characterized by …

WebThe maximum Wiener polarity index of unicyclic graphs [J]. Appl Math Comput, 2012, … Web30 de out. de 2024 · Moreover, SAGE simulations on graphs with up to ten vertices confirm that the pair of graphs shown in Fig. 2 is the smallest and unique pair of D-cospectral graphs having different diameter and Wiener index.. Download : Download high-res image (45KB) Download : Download full-size image Fig. 1. Two graphs on four vertices which …

Web1 de mar. de 2013 · Tang and Deng (J. Math. Chem. 43:60–74, 2008) considered the … Webof the two vertices vi and vj in the graph G (i.e., the number of edges in a shortest path connecting vi and vj). Mathematical properties and applications of H are reported in [4, 9, 10, 21, 30]. Another distance-based topological indices of a graph G is the Wiener index W(G). As an oldest topological index, the Wiener index of a graph G ...

Web28 de jul. de 2012 · Unicyclic graphs are connected graphs with the same number of …

WebEditor’s Choice articles are based on recommendations by the scientific editors of MDPI … tree trimming service canon city coWebSearch ACM Digital Library. Search Search. Advanced Search tree trimming service chandlerWeb1 de out. de 2009 · It has found various applications in chemical research and has been … tree trimming service cape coral flWebSZEGED 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 … tree trimming service carlsbad nmWeb6 de abr. de 2024 · In the case of unicyclic graphs f(x) ... Mn – index, Hosoya … tempeh and bean chiliWeb28 de mai. de 2009 · Then the Wiener index of G with respect to c is W ( G, c) = ∑ { x, y } ⊆ V c ( x) c ( y) d ( x, y). We note that for c ≡ 1 this yields the usual Wiener index, while for c ( x) = deg ( x) we obtain the Gutman index. The edge-Wiener index of a graph is connected to its Gutman index by the following inequality. Theorem 5. tree trimming service des moines iaWebLiu 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 tree trimming service corona ca