On the sum connectivity gourava index
Web2ndhyper Gourava index, Product connectivity Gourava index, Sum connectivity Gourava index, Forgotten index, Forgotten polynomials, M-polynomials and some topological indices in terms of M-polynomials i:e:1st Zagreb index , 2nd Zagreb index, Modified 2nd Zagreb, Randic index,´ Reciprocal Randi´c index, Symmetric division … WebW e introduce the sum connectivity Gourava index of a molecular graph. In this paper, we determine the sum connectivity Gourava index of some standard classes of graphs. …
On the sum connectivity gourava index
Did you know?
Webx+ y+ xy Sum-connectivity Gourava index p (x+ y)xy Product-connectivity Gourava index p x2 + y2 Sombor index 58. X. Li and D. Peng / Discrete Math. Lett. 9 (2024) 57–66 59 From Table1, one can see that these chemical indices have the following unified definition. Let f(x;y) be a symmetric real Web28 de set. de 2024 · In this paper, we compute the first and second hyper Gourava indices, sum connectivity Gourava index, product connectivity Gourava index, general first …
WebThe sum-connectivity index of a graph G is defined as the sum of weights 1 / d u + d v over all edges u v of G , where d u and d v are the degrees of the vertices u and v in graph G , respectively. In this paper, we give a sharp lower bound on the sum-connectivity index unicyclic graphs of order n ≥ 7 and diameter D G ≥ 5 . Download Full-text WebIn Section 5, we compute the generalization of Zagreb index, the generalized Zagreb index, the first and second hyper -indices, the sum connectivity F-index, and the product connectivity F-index graphs of . For more details about these indices, see [12, 13, 29–39]. 2. Results for Silicon-Carbon
Web20 de mai. de 2009 · Abstract. We report some properties especially lower and upper bounds in terms of other graph invariants for the general sum-connectivity index which generalizes both the ordinary sum-connectivity index and the first Zagreb index. Additionally, we give the Nordhaus-Gaddum-type result for the general sum … Web1 de abr. de 2024 · Read On Topological Indices of Subdivided and Line Graph of Subdivided Friendship Graph
Web21 de set. de 2024 · In this paper we compute Revan first index, Revan second index, Revan third index and their polynomials for list of silicon carbide graphs. ... V. R. Kulli, On the sum connectivity Gourava index, International Journal of Mathematical Archive, 8(7)(2024) 211-217.
Web30 de jun. de 2024 · PDF On Jun 30, 2024, V. R. Kulli published On the sum connectivity Gourava index Find, read and cite all the research you need on ResearchGate tscc50psWebKeywords: Status, multiplicative hyper status Gourava indices, multiplicative sum and product connectivity status Gourava indices, graph. Mathematics Subject Classification: 05C05, 05C07, 05C35. 1. INTRODUCTION A graph index is a numerical parameter mathematically derived from the graph structure. Several graph indices have tscc50yeWeb(x+ y)xy Second Gourava index (x+ y+ xy)2 First hyper-Gourava index [(x+ y)xy]2 Second hyper-Gourava index 1= p px+ y+ xy Sum-connectivity Gourava index p(x+ y)xy Product-connectivity Gourava index x2 + y2 Sombor index 1 From Table 1, one can see that these chemical indices have the following uni ed de nition. Let f(x;y) be a symmetric real ... tsc.ca bellina fashionsWeb21 de mai. de 2024 · Abstract. In this research paper, we will compute the topological indices (degree based) such as the ordinary generalized geometric-arithmetic (OGA) … tscc50reWeb2 de jun. de 2024 · In this manuscript, we compute Zagreb index (ZI), first, and second, Hyper F-indices and sum and product connectivity of F-index of silicon carbides, namely, SiC4 – I[r, s] and SiC4 – II[r, s]. 1. Introduction Graph theory deals with the study of the mathematical structures of chemical compounds. philly tap finderWeb3 de nov. de 2024 · Graphs under inspection in this paper are undirected and simple, without various edges and finite. Considering a graph , the sets of nodes and lines are … philly tap and tavern menuWebKeywords: sum connectivity Gourava index, nanostructures. 1. INTRODUCTION . Let G be a finite, simple and connected graph with a vertex set (GV) and an edge set E(G). … philly tap and tavern chester