Results 11 to 20 of about 16,596 (251)
Note of 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 υ,ν 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 υ and ν.
Gutman Ivan +2 more
doaj +4 more sources
The Steiner Wiener Index of A Graph
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,v∈V(G) d(u, v) where dG(u, v) is the distance between vertices u and v of G. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +2 more sources
The Mostar and Wiener index of Alternate Lucas Cubes [PDF]
The Wiener index and the Mostar index quantify two distance related properties of connected graphs: the Wiener index is the sum of the distances over all pairs of vertices and the Mostar index is a measure of how far the graph is from being distance ...
Omer Eğecioğlu +2 more
doaj +1 more source
Equiseparability on Terminal Wiener Index [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaotie Deng, Jie Zhang 0008
openaire +6 more sources
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Let G=VG,EG be a molecular graph, where VG and EG are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quantity which helps to predict the chemical/physical properties of the molecules.
Bo Bi +5 more
doaj +1 more source
Distance-Based Polynomials and Topological Indices for Hierarchical Hypercube Networks
Topological indices are the numbers associated with the graphs of chemical compounds/networks that help us to understand their properties. The aim of this paper is to compute topological indices for the hierarchical hypercube networks. We computed Hosoya
Tingmei Gao, Iftikhar Ahmed
doaj +1 more source
Wiener index of quadrangulation graphs
The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. É. Czabarka, et al. conjectured that for an $n$-vertex, $n\geq 4$, simple quadrangulation graph $G$, \begin{equation*}W(G)\leq \begin{cases} \frac{1}{12}n^3+\frac{7}{6}n-2, &\text{ $n\equiv 0~(mod \ 2)$,}\\ \frac{1}{12}n^3+\frac{11}{12}
Ervin Györi +2 more
openaire +2 more sources
Multicenter Wiener indices and their applications [PDF]
The Wiener index W can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms. A generalization of the W are the Steiner-Wiener indices kW, k=3,4,....
Gutman Ivan, Furtula Boris, Li Xueliang
doaj +1 more source
The Wiener index of signed graphs [PDF]
The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of Šolt{é}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being $G=C_{11}$. We relax this problem by defining a notion of Wiener indices for signed graphs, which we denote by $W_σ(G)$, and ...
openaire +3 more sources
Hosoya Polynomials Of Some Semiconducotors
The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x = 1 is equal to the Wiener index and second derivative at x =1 is equal to the hyperï€Wiener index.
Azeez Lafta Jabir +2 more
doaj +1 more source

