Photo from wikipedia
Abstract The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bipartite graph. If a graph invariant decreases or increases with addition… Click to show full abstract
Abstract The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bipartite graph. If a graph invariant decreases or increases with addition of edges of its complement, then it is called a monotonic graph invariant. In this article, we determine the extremal values of some famous monotonic graph invariants, and characterize the corresponding extremal graphs in the class of all connected graphs with a given vertex bipartiteness.
Keywords:
monotonic graph;
results monotonic;
invariants bipartiteness;
number;
graph invariants
Journal Title: Quaestiones Mathematicae
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Quaestiones Mathematicae
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!