Results 31 to 40 of about 15,653 (260)

Wiener Index, Hyper-wiener Index, Harary Index and Hamiltonicity of graphs

open access: yes, 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

On the Wiener Polarity Index of Lattice Networks. [PDF]

open access: yesPLoS ONE, 2016
Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications.
Lin Chen   +4 more
doaj   +1 more source

Degree-weighted Wiener index of a graph

open access: yesMathematical Modelling and Control
From geometric point of view, we introduced the Sombor-Wiener index of a graph and studied the basic properties of the new index. It was shown that the Sombor-Wiener index was useful in predicting the acentric factor of octane isomers.
Zhen Lin, Ting Zhou
doaj   +1 more source

Sufficient Conditions for Hamiltonicity of Graphs with Respect to Wiener Index, Hyper-Wiener Index, and Harary Index

open access: yesJournal of Chemistry, 2019
In this paper, with respect to the Wiener index, hyper-Wiener index, and Harary index, it gives some sufficient conditions for some graphs to be traceable, Hamiltonian, Hamilton-connected, or traceable for every vertex.
Guisheng Jiang, Lifang Ren, Guidong Yu
doaj   +1 more source

Steiner Wiener index of Line graphs

open access: yesIndian Journal of Pure and Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V. A. Rasila, Ambat Vijayakumar
openaire   +1 more source

Some distance based indices of graphs based on four new operations related to the lexicographic product

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
For a (molecular) graph, the Wiener index, hyper-Wiener index and degree distance index are defined as $$W(G)= \sum_{\{u,v\}\subseteq V(G)}d_G(u,v),$$ $$WW(G)=W(G)+\sum_{\{u,v\}\subseteq V(G)} d_{G}(u,v)^2,$$ and $$DD(G)=\sum_{\{u,v\}\subseteq V(G)}d_G(u,
N. Dehgardi   +2 more
doaj   +1 more source

The edge-Wiener index and the edge-hyper-Wiener index of phenylenes [PDF]

open access: yesDiscrete Applied Mathematics, 2019
Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in the recent years.
openaire   +2 more sources

Diabetes‐induced vascular calcification is associated with low pyrophosphate and its oral supplementation prevents calcification in diabetic mice

open access: yesFEBS Open Bio, EarlyView.
Induction of diabetes in three different mouse strains uniformly resulted in an increase in TNAP activity and a reduction in pyrophosphate (PPi) in the circulation. Inhibition of TNAP restored plasma PPi. Diabetes‐induced calcification in the media layer of the aorta was detected only in the Abcc6−/− strain, which is predisposed to ectopic ...
Krisztina Fülöp   +13 more
wiley   +1 more source

The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]

open access: yesDiscrete 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

The Wiener index of signed graphs [PDF]

open access: yesApplied Mathematics and Computation, 2022
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 ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy