LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Complete Characterization of Bipartite Graphs with Given Diameter in Terms of the Inverse Sum Indeg Index

Photo by stonedrake33148 from unsplash

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… Click to show full 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.

Keywords: inverse sum; indeg index; sum indeg; bipartite graphs

Journal Title: Axioms
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.