Results 91 to 100 of about 28,315 (192)
Wiener Index, Hyper-wiener Index, Harary Index and Hamiltonicity of graphs
, 2018 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
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 +1 more source
Original scientific paper Hyper-Wiener index and Laplacian spectrum
, 2003 : The hyper-Wiener index WWW of a chemical tree T is defined as the sum of the product n1 n2 n3, over all pairs u, of vertices of T,wheren1and n2 are the number of vertices of T, lying on the two sides of the path which connects u and ,andn3is the ...
Ivan Gutman
core
The maximum Wiener index of a uniform hypergraph
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize all hypergraphs attaining the ...
Tuite, James +4 more
core +1 more source
On Wiener index and Wiener polarity index of some polyomino chains
, 2019 A graph invariant is a numerical value that depicts the structural properties of an entire graph. The Wiener index is the oldest distance based graph invariant which is defined as the sum of distances between all unordered pair of vertices of the graph G.
Mohammad R. Farahani +11 more
core +1 more source
Wiener and vertex PI indices of the strong product of graphs
, 2012 The Wiener index of a connected graph G, denoted by W(G), is defined as $½ ∑_{u,v ∈ V(G)}d_G(u,v)$. Similarly, the hyper-Wiener index of a connected graph G, denoted by WW(G), is defined as $½W(G) + ¼ ∑_{u,v ∈ V(G)} d²_G(u,v)$.
Pattabiraman, K., Paulraja, P.
core +1 more source
Equiseparability on terminal Wiener index
, 2009 The aim of this work is to explore the properties of the terminal Wiener index, which was recently proposed by Gutman et al. (2004) [3], and to show the fact that there exist pairs of trees and chemical trees which cannot be distinguished by using it. We
Deng, X +5 more
core +2 more sources
Alter Wiener and Suzanne Spencer oral history recording [PDF]
, 2000 An index of an oral history of Alter Wiener and Suzanne Spencer on civilian life during the Korean ...
Spencer, Suzanne, Wiener, Alter
core
p-Wiener intervals and p-Wiener free intervals
, 2012 A positive integer n is said to be Wiener graphical, if there exists a graph G with Wiener index n. In this paper, we prove that any positive integer n(≠ 2,5) is Wiener graphical.
Arockiaraj, S., Kathiresan, Kumarappan
core +1 more source