Graphs having extremal monotonic topological indices with bounded vertex k-partiteness

From MaRDI portal
Publication:1786967

DOI10.1007/S12190-017-1151-YzbMATH Open1401.05094arXiv1708.00970OpenAlexW2963062820MaRDI QIDQ1786967FDOQ1786967


Authors: Fang Gao, Duo-Duo Zhao, Xiaoxin Li, Jiabao Liu Edit this on Wikidata


Publication date: 25 September 2018

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Abstract: The vertex k-partiteness vk(G) of graph G is defined as the fewest number of vertices whose deletion from G yields a k-partite graph. In this paper, we introduce two concepts: monotonic decreasing topological index and monotonic increasing topological index, and characterize the extremal graphs having the minimum Wiener index, the maximum Harry index, the maximum reciprocal degree distance, the minimum eccentricity distance sum, the minimum adjacent eccentric distance sum index, the maximum connective eccentricity index, the maximum Zagreb indices among graphs with a fixed number n of vertices and fixed vertex k-partiteness, respectively.


Full work available at URL: https://arxiv.org/abs/1708.00970




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786967)