Results 11 to 20 of about 32,921 (201)
Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs [PDF]
Journal of Chemical Information and Computer Sciences, 2002 The hyper-Wiener index WW of a graph G is defined as WW(G) = (summation operator d (u, v)(2) + summation operator d (u, v))/2, where d (u, v) denotes the distance between the vertices u and v in the graph G and the summations run over all (unordered) pairs of vertices of G.
Gordon, Cash +2 more
openaire +3 more sources
Sufficient Conditions for Wiener Index, Hyper-Wiener Index and Harary Index of the Hamilton Graph
Mathematics and Computer ScienceThe topological index can be used to depict the structural properties of graphs, and the Hamiltonian problem of graphs has always been a classical problem in graph theory. In this work, we use some known conditions to give some sufficient conditions for Hamilton graphs by the Wiener index, Hyper-Wiener index and Harary index of a graph.
Jiangyi Liu
openaire +2 more sources
The structure of graphs with extremal hyper-Wiener index
FilomatThe hyper-Wiener index of a graph G is defined as WW(G) = 1/2 ?{u,v}?V(G) (d2G(u,v)+dG(u,v)), where dG(u,v) denotes the distance between u and v in G. In this paper, we determine the maximum hyper-Wiener index of 2-connected graphs and 2-edge-connected graphs, which extends the result of Plesnik [On the sum of all distances in a graph or digraph, J ...
Hechao Liu, Lihua You, Yufei Huang
openaire +2 more sources
Relationship between the Hosoya polynomial and the hyper-Wiener index
Applied Mathematics Letters, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Cash
openaire +2 more sources
Hyper Wiener Index of Concatenated Pentagons in Two Rows
International Journal of Scientific and Innovative Mathematical Research, 2018 In straight chaining (second case) the graph consisting of 5-cycles in two rows with ‘b’ cycles in row 1 and ‘a’ cycles in row 2 denoted by G(a,b,S2) is as shown below.
M. Srujana, N. P. Rao
openaire +2 more sources
Five results on maximizing topological indices in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number.
Stijn Cambie
doaj +1 more source
The Wiener, hyper-Wiener, Harary and SK indices of the P(Z_{p^k.q^r}) power graph [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 The undirected P(Zₙ) power graph of a finite group of Zₙ is a connected graph, the set of vertices of which is Zₙ. Here u,v∈P(Zₙ) are two diverse adjacent vertices if and only if u≠v and ⟨v⟩ ⊆ ⟨u⟩ or ⟨u⟩ ⊆ ⟨v⟩.
Volkan Aşkin
doaj +1 more source
HYPER-WIENER INDEX OF ZIGZAG POLYHEX NANOTUBES [PDF]
The ANZIAM Journal, 2008 Abstract The hyper-Wiener index of a connected graph G is defined as $WW(G)=(1/4)\sum _{(u,v)\in V(G)\times V(G)}\big (d(u,v)+d(u,v)^2\big )$ , where V (G) is the set of all vertices of G and d(u,v) is the distance between the vertices u,v∈V (G).
Eliasi, Mehdi, Taeri, Bijn
openaire +1 more source
Hosoya polynomial of zigzag polyhex nanotorus [PDF]
Journal of the Serbian Chemical Society, 2008 The Hosoya polynomial of a molecular graph G is defined as ... , where d(u,v) is the distance between vertices u and v. The first derivative of H(G,l) at l = 1 is equal to the Wiener index of G, defined as .... . The second derivative of .... at l = 1 is
MEHDI ELIASI, BIJAN TAERI
doaj +3 more sources
Application of Some Topological Indices in Nover Topologized Graphs [PDF]
Neutrosophic Sets and Systems, 2023 There are many applications of graph theory to a wide variety of subjects which include operation Research, Physics, chemistry, Economics, Genetics, Engineering, computer Science etc.,In a classical graph for each vertex or edge there are two ...
G. Muthumari, R. Narmada Devi
doaj +1 more source