On maximum Wiener index of trees and graphs with given radius
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0092-y
Abstract: Let G be a connected graph of order n. The long-standing open and close problems in distance graph theory are: what is the Wiener index W(G) or average distance $$\mu (G)$$μ(G) among all graphs of… read more here.
Keywords: wiener; trees graphs; number; wiener index ... See more keywords
On the reduced second Zagreb index of trees
Sign Up to like & getrecommendations! Published in 2017 at "Asian-european Journal of Mathematics"
DOI: 10.1142/s179355711750084x
Abstract: The current note is devoted to investigate the trees, which maximize or minimize the reduced second Zagreb index among all n-vertex trees with fixed number of segments. This note also involves development of some results,… read more here.
Keywords: reduced second; index; second zagreb; zagreb index ... See more keywords
On Mostar index of trees with parameters
Sign Up to like & getrecommendations! Published in 2019 at "Filomat"
DOI: 10.2298/fil1919453h
Abstract: The Mostar index of a graph G is defined as the sum of absolute values of the differences between nu and nv over all edges uv of G, where nu and nv are respectively, the… read more here.
Keywords: index; mostar index; number; trees parameters ... See more keywords
The Bounds of Vertex Padmakar–Ivan Index on k-Trees
Sign Up to like & getrecommendations! Published in 2019 at "Mathematics"
DOI: 10.3390/math7040324
Abstract: The Padmakar–Ivan ( P I ) index is a distance-based topological index and a molecular structure descriptor, which is the sum of the number of vertices over all edges u v of a graph such… read more here.
Keywords: ivan index; padmakar ivan; index trees; bounds vertex ... See more keywords