Wiener index in graphs given girth, minimum, and maximum degrees
Theory and Applications of Graphs, 2023 Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$.
Fadekemi J. Osaye +3 more
doaj +1 more source
Eccentricity based topological indices of face centered cubic lattice FCC(n)
Main Group Metal Chemistry, 2021 Chemical graph theory has become a prime gadget for mathematical chemistry due to its wide range of graph theoretical applications for solving molecular problems.
Shaker Hani +2 more
doaj +1 more source
The n-Wiener Polynomials of the Cartesian Product of a Complete Graph with some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2009 The n-Wiener polynomials of the Cartesian products of a complete graph Kt with another complete graph Kr, a star graph Sr, a complete bipartite graph Kr,s, a wheel Wr, and a path graph Pr are obtained in this paper.
Ali Ali, Haveen Ahmed
doaj +1 more source
Sharp bounds and normalization of Wiener-type indices. [PDF]
PLoS ONE, 2013 Complex networks abound in physical, biological and social sciences. Quantifying a network's topological structure facilitates network exploration and analysis, and network comparison, clustering and classification.
Dechao Tian, Kwok Pui Choi
doaj +1 more source
The wiener index of the zero-divisor graph for a new class of residue class rings
Frontiers in Chemistry, 2022 The zero-divisor graph of a commutative ring R, denoted by Γ(R), is a graph whose two distinct vertices x and y are joined by an edge if and only if xy = 0 or yx = 0.
Yinhu Wei, Ricai Luo
doaj +1 more source
Unicyclic Graphs with the Fourth Extremal Wiener Indices
Journal of Chemistry, 2020 A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang +3 more
doaj +1 more source
Weiner Polynomials for Generalization of Distance for Some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2006 The minimum distance of a vertex v to an set of vertices of a graph G is defined as : . The n-Wiener polynomial for this distance of a graph G is defined as , where is the number of order pairs (v,S), , such that , and is the diameter
Ali Ali, Ahmed Ali
doaj +1 more source
Hosoya and Harary Polynomials of TOX(n),RTOX(n),TSL(n) and RTSL(n)
Discrete Dynamics in Nature and Society, 2019 In the fields of chemical graph theory, topological index is a type of a molecular descriptor that is calculated based on the graph of a chemical compound.
Lian Chen +5 more
doaj +1 more source
Gutman index, edge-Wiener index and edge-connectivity [PDF]
Transactions on Combinatorics, 2020 We study the Gutman index ${\rm Gut}(G)$ and the edge-Wiener index $W_e (G)$ of connected graphs $G$ of given order $n$ and edge-connectivity $\lambda$.
Jaya Mazorodze +2 more
doaj +1 more source
Hosoya Polynomials of Steiner Distance of Complete m-partite Graphs and Straight Hexagonal Chains(*) [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 The Hosoya polynomials of Steiner distance of complete m-partite graphs and Straight hexagonal chains are obtained in this paper. The Steiner n-diameter and Wiener index of Steiner n-distance of and are also obtained.
Ali Ali, Herish Abdullah
doaj +1 more source