A Complete Characterization of Bipartite Graphs with Given Diameter in Terms of the Inverse Sum Indeg Index
Author:
Su Guifu,Song Guanbang,Du Junfeng,Yang Weixing,Rao Gang,Yin Jun
Abstract
In 2010, Vukičević introduced an new graph invariant, the inverse sum indeg index of a graph, which has been studied due to its wide range of applications. Let Bnd be the class of bipartite graphs of order n and diameter d. In this paper, we mainly characterize the bipartite graphs in Bnd with the maximal inverse sum indeg index. Bipartite graphs with the largest, second-largest, and smallest inverse sum indeg indexes are also completely characterized.
Funder
Natural Science Foundation of Beijing
National Key Research and Development Project
Natural Science Funds of China
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference18 articles.
1. Bondy, J.A., and Murty, U.S.R. (2008). Lukovits, Graph Theory, GTM 244, Springer.
2. Bond additive modeling 1. Adriatic indices;Croat. Chem. Acta.,2010
3. Bond additive modeling 2. Mathematical properties of max-min rodeg index;Croat. Chem. Acta,2010
4. On the inverse sum indeg index;Sedlar;Discret. Appl. Math.,2015
5. Sharp bounds on the inverse sum indeg index;Azari;Discret. Appl. Math.,2017