site stats

On the wiener index of unicyclic graphs

WebDOI: 10.46793/match.88-1.179m Corpus ID: 245986474; Upper and Lower Bounds for … Web15 de jun. de 2012 · The Wiener polarity index of a graph G is the number of unordered …

The Reciprocal Reverse Wiener Index of Unicyclic Graphs - JSTOR

WebHá 2 dias · In this paper, we obtain the graph with the least Wiener index among all the unicyclic graphs with n vertices and diameter d. Moreover, if 4≤d≤n-3, d≡0(mod 2), then the unicyclic graphs with ... Web1 de jan. de 2010 · The Wiener index of a graph G is defined as W (G)=∑ u,v∈V (G) d G … how many calories are in 16 oz of asparagus https://ladysrock.com

Third Smallest Wiener Polarity Index of Unicyclic Graphs

Web6 de abr. de 2024 · In the case of unicyclic graphs f(x) ... Mn – index, Hosoya … Web17 de out. de 2016 · The Wiener index is the sum of distances between all pairs of … Webdirection is to determine the graphs with maximal, or minimal Wiener index in a given … high quality fitted sheet

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

Category:THE GUTMAN INDEX OF UNICYCLIC GRAPHS Discrete …

Tags:On the wiener index of unicyclic graphs

On the wiener index of unicyclic graphs

[1102.5409v1] The Wiener Index of Unicyclic Graphs with Girth …

WebThe maximum Wiener polarity index of unicyclic graphs [J]. Appl Math Comput, 2012, 218(20): 10149-10157. [9] BANDY J B A, MURTY U S R. Graph theory [M]. London: Springer, 2008. [10] LIU Bolian, HOU Huoquan, HUANG Yufen. On the Wiener polarity index of trees with maximum degree or given number of leaves [J]. Web15 de jun. de 2012 · The Wiener polarity index W p (G) of a graph G is the number of …

On the wiener index of unicyclic graphs

Did you know?

WebA unicyclic graph is a connected graph with the same number of edges and vertices. In this paper, we study the lower and upper bounds of Steiner \(k\)-Wiener index of unicyclic graphs. In addition, we also obtain the second largest … Web1 de out. de 2009 · It has found various applications in chemical research and has been …

WebA. Hamzeh S. Zadeh A. Ashrafi Extremal graphs under wiener type invariants MATCH Commun. Math. Comput. Chem.69 2013 47 54 [Google Scholar] B. Horoldagva K. Das Sharp lower bounds for the zagreb indices of unicyclic graphs Turkish J. Math.39 2015 595 603 , [Google Scholar] M. Khalifeh H. Azari A. Ashrafi The hyper-Wiener index of … Web30 de out. de 2024 · Moreover, SAGE simulations on graphs with up to ten vertices …

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. WebThe Wiener index of a graph G is defined as W(G) = P u,v dG(u,v), where dG(u,v) is …

Web1 de dez. de 2013 · In this paper, we obtain the graph with the least Wiener index … how many calories are in 180 grams of chickenWebThe maximum Wiener polarity index of unicyclic graphs [J]. Appl Math Comput, 2012, … high quality flag polesWebLiu 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 high quality flameless candlesWeb2 Unicyclic graphs with minimum and maximum vertex Co−PI index. A connected … high quality flannel shirt clearance menWebOur paper is organized as follows: In Section 2, we give necessary definitions and state the main results of the paper. The first result determines the graphs with the fourth, fifth, sixth and seventh largest values on W ⁢ (G) 𝑊 𝐺 W(G) italic_W ( italic_G ) among all unicyclic graphs of order n ⩾ 10; 𝑛 10 n\geqslant 10; italic_n ⩾ 10 ; while the second result … high quality flannel bathrobehttp://mat76.mat.uni-miskolc.hu/mnotes/download_article/2793.pdf high quality flannel fleece bathrobeWebLet 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 … how many calories are in 2 bread rolls