Photo by sinaktc from unsplash
The vertex k-partiteness $$v_k(G)$$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 some monotonic… Click to show full abstract
The vertex k-partiteness $$v_k(G)$$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 some monotonic topological indices, and characterize the extremal corresponding graphs among graphs of order n and fixed vertex k-partiteness.
Keywords:
monotonic topological;
topological indices;
vertex partiteness;
graphs extremal
Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!