Results 41 to 50 of about 16,423 (156)
The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj +1 more source
Hyper-Wiener index and Laplacian spectrum [PDF]
Journal of the Serbian Chemical Society, 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, 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, and n3 is the
IVAN GUTMAN
doaj +3 more sources
The Hyper-Wiener Index of Trees of Order n with Diameter d
Discrete Dynamics in Nature and Society, 2016 The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index WW(G) is defined as WW(G)=1/2∑u,v∈VGdGu,v+dG2u,v with the summation going over all pairs of ...
Gaixiang Cai +4 more
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
The hyper edge-Wiener index of corona product of graphs [PDF]
Transactions on Combinatorics, 2015 Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances between edges in G , whereas the hyper edge-Wiener index WW e (G) is defined as {\footnotesize WW e (G)=12 W e (G)+12 W 2 e (G) }, where {footnotesize W 2 e ...
Abolghasem Soltani, Ali Iranmanesh
doaj
Molecular Topology Index of a Zero Divisor Graph on a Ring of Integers Modulo Prime Power Order
Contemporary Mathematics and Applications (ConMathA)In chemistry, graph theory has been widely utilized to address molecular problems, with numerous applications in graph theory and ring theory within this field.
Didit Satriawan +4 more
doaj +1 more source
Selected topics on Wiener index
Ars Mathematica ContemporaneaThe Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of research. This work presents a natural continuation of the paper Mathematical aspects of Wiener index (Ars Math. Contemp.,
Knor, Martin +2 more
openaire +3 more sources
Wiener index and Steiner 3-Wiener index of a graph
, 2018 Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the Steiner $k$-Wiener index, hence for $k=2$ we get the Wiener index. The modular graphs are graphs in which every three
Kovše, Matjaž +2 more
openaire +2 more sources
Steiner Wiener index of block graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size of a connected subgraph of G containing all the vertices of S.
Matjaž Kovše +2 more
doaj +1 more source
Peripheral Wiener index of a graph
Communications in Combinatorics and Optimization, 2017 The {\em eccentricity} of a vertex $v$ is the maximum distance between $v$ and any other vertex. A vertex with maximum eccentricity is called a peripheral vertex.
K.P. Narayankar, S.B. Lokesh
doaj +1 more source