Results 151 to 160 of about 580,793 (206)
On minimizing the Wiener index of unicyclic graphs with fixed girth and given degree sequence
The Wiener index of a graph is the sum of all the distances between any pair of vertices. We aim to describe graphs which minimize the Wiener index among all unicyclic graphs with fixed girth and given degree sequence.
Rakotonarivo, Valisoa R. M. +1 more
core
Hyper-Zagreb index in fuzzy environment and its application. [PDF]
Islam SR, Mohsin BB, Pal M.
europepmc +1 more source
On Wiener polarity index of bicyclic networks. [PDF]
Ma J, Shi Y, Wang Z, Yue J.
europepmc +1 more source
Graphs with given connectivity and their minimum Sombor index having applications to QSPR studies of monocarboxylic acids. [PDF]
Hayat S, Arshad M, Khan A.
europepmc +1 more source
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets. [PDF]
Brewster RC, Mynhardt CM, Teshima LE.
europepmc +1 more source
Modelling infectious diseases with relapse: a case study of HSV-2. [PDF]
Wang J +4 more
europepmc +1 more source
Serum protein biomarkers for juvenile dermatomyositis: a pilot study. [PDF]
Tawalbeh SM +5 more
europepmc +1 more source
Degree sums and dense spanning trees. [PDF]
Li T, Gao Y, Dong Q, Wang H.
europepmc +1 more source
On the signless laplacian spectral radius of bicyclic graphs with perfect matchings. [PDF]
Zhang JM, Huang TZ, Guo JM.
europepmc +1 more source

