Summary of - Some Properties and Topological Indices of k-nested Graphs

Document Type

Article

Abstract

A double nested graph is a bipartite graph with the property that the neighborhood of vertices of each partite set form a chain with respect to set inclusion. Motivated by this structure, we generalize and define a new class of graphs and name it as k-nested graphs and study its properties. Characterization of a k-nested 2-self centered graph which is edge maximal is discussed and also we show that none of the k-nested 2-self centered graph is edge minimal. We extend the study and gave the bounds for Wiener index and some Szeged

indices of k-nested graphs. We conclude this article by exploring some more degree based topological indices of k-nested graphs.

Index Terms: k-partite graphs, chain graphs, 2-self centered graphs, distance and degree based topological index.

Recommended Citation: Shashwath S Shetty, and K Arathi Bhat, "Some Properties and Topological Indices of k-nested Graphs," IAENG International Journal of Computer Science, vol. 50, no.3, pp921-929, 2023

Publication Date

2023

Link to Full Text

Share

COinS