Results 51 to 60 of about 16,423 (156)
Wiener Index of Edge Thorny Graphs of Catacondensed Benzenoids
The Wiener index is a topological index of a molecular graph, defined as the sum of distances between all pairs of its vertices. Benzenoid graphs include molecular graphs of polycyclic aromatic hydrocarbons.
Andrey A. Dobrynin, Ali Iranmanesh
doaj +1 more source
Wiener Index, Hyper-wiener Index, Harary Index and Hamiltonicity of graphs
In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with given the minimum degree to be traceable and Hamiltonian, respectively.
Yu, Guidong, Ren, Lifang, Cai, Gaixiang
openaire +2 more sources
Wiener index of Eulerian graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman, Roberto Cruz, Juan Rada
openaire +2 more sources
Note on the Hyper-Wiener Index [PDF]
The hyper-Wiener index WW of a chemical tree T is defined as the sum of the products n1n2, over all pairs u, u of vertices of T, where n1 and n2 are the number of vertices of T, lying on the two sides of the path which connects u and u.
IVAN GUTMAN +2 more
doaj
The Wiener index, degree distance index and Gutman index of composite hypergraphs and sunflower hypergraphs. [PDF]
Ashraf S +3 more
europepmc +1 more source
The wiener index of the zero-divisor graph for a new class of residue class rings. [PDF]
Wei Y, Luo R.
europepmc +1 more source
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree
The 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 ...
Jianping Ou, Xing Feng, Saihua Liu
doaj +1 more source
The edge-Wiener index of a graph
The Wiener index \(W(G)\) of a (connected) graph \(G\) is the sum of distances between all pairs of vertices in \(G\). The edge-Wiener index \(W_e(G)\) of \(G\) is the Wiener index of its line graph \(L(G)\), i.e., \(W_e(G)=W(L(G))\). The authors give bounds on \(W_e(G)\) in terms of order and size of \(G\). In particular, they prove that \(W_e(G)\leq \
Peter Dankelmann +3 more
openaire +2 more sources
Steiner Wiener index of graph products [PDF]
The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G.
Yaoping Mao, Zhao Wang, Ivan Gutman
doaj
Among various graph products, the corona product continues to inspire novel research. Subdivision graphs play a key role in understanding graph behaviour under edge modifications.
Vimal M. +3 more
doaj +1 more source

