site stats

On the wiener index of unicyclic graphs

WebAbstract. The Wiener polarity index of a graph is the number of unordered pairs of vertices of such that the distance between and is 3. Cycle-block graph is a connected graph in which every block is a cycle. In this paper, we determine the maximum and minimum Wiener polarity index of cycle-block graphs and describe their extremal graphs; the … WebHá 2 dias · In this paper, we obtain the graph with the least Wiener index among all the …

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

Web1 de dez. de 2013 · In this paper, we obtain the graph with the least Wiener index … Web15 de jun. de 2012 · The Wiener polarity index of a graph G is the number of unordered … smart assist customer service https://dvbattery.com

arXiv:1902.10661v3 [math.CO] 21 Dec 2024

Web1 de jun. de 2016 · The Wiener index is the sum of distances between all pairs of distinct … 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 … 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 ... hill day at home 2021

arXiv:1902.10661v3 [math.CO] 21 Dec 2024

Category:The Wiener index of unicyclic graphs given number of …

Tags:On the wiener index of unicyclic graphs

On the wiener index of unicyclic graphs

Full article: Topological indices of the -graph - Taylor & Francis

Web9 de mar. de 2024 · Molecular trees and unicyclic graphs are characterized by identifying extremal NI index. ... [37] Poulik S., Ghorai G., Determination of journeys order based on graph’s wiener absolute index with bipolar fuzzy information, Inf. Sci. 545 (2024) ... WebKeywords: Edge Szeged index; Revised edge Szeged index; Unicyclic graph; Diameter. 2010 MSC: 05C40, 05C90 1 Introduction Throughout this paper, all graphs we considered are simple, undirected and connected. Let ... [14] S. Tan, The minimum Wiener index of unicyclic graphs with a fixed diameter, J. Appl. Math. Comput. (2016) 1–22.

On the wiener index of unicyclic graphs

Did you know?

WebWiener (RRW) matrix RRW(G) of G is an n×n matrix (rij) such that rij = 1 d(G)−dij if i, j and dij < d(G), and 0 otherwise [3, 4]. For a connected graph G, its Wiener index is defined as the sum of distances between all unordered pairs of distinct vertices of G [2, 8]. In parallel to this definition, the reciprocal reverse Wiener (RRW) index WebDOI: 10.46793/match.88-1.179m Corpus ID: 245986474; Upper and Lower Bounds for …

Web2 Unicyclic graphs with minimum and maximum vertex Co−PI index. A connected … Webwhere M 1 (Γ) and F (Γ) present the first Zagreb and forgotten indices of the (molecular) …

WebThe Wiener index of a graph G is defined as W (G) = ∑ u,v dG(u, v), where dG(u, v) is … WebThe Wiener Index of Unicyclic Graphs with Girth and the Matching Number

Web27 de out. de 2024 · The Wiener polarity index WP(G) of a graph G is the number of …

http://www.kurims.kyoto-u.ac.jp/EMIS/journals/BMMSS/pdf/acceptedpapers/2011-03-039_R1.pdf hill dcWeb16 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. smart assist login flipkartWebThe Wiener index of a graph G is defined as W(G) = P u,v dG(u,v), where dG(u,v) is … hill deity crosswordWeb11 de set. de 2008 · We determine the maximum values of the reverse Wiener indices of … smart assist paycheckWeb伊佳茹，雷英杰(中北大学 理学院， 太原 030051)给定直径的单圈图的Harary指数伊佳茹，雷英杰(中北大学 理学院， 太原 030 smart assist power virtual agentWebHá 1 dia · The revised edge Szeged index of is defined as , where (resp., ) is the number … smart assist presenceWebSearch ACM Digital Library. Search Search. Advanced Search hill db