Abstract
A graph is -excellent if every vertex of is contained in some maximum independent set of . In this paper, we characterize -excellent bipartite graphs, -excellent unicyclic graphs, -excellent simplicial graphs, -excellent chordal graphs, -excellent block graphs, and we show that every generalized Petersen graph is -excellent.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.