Abstract
AbstractA graph G is $$\alpha $$
α
-excellent if every vertex of G is contained in some maximum independent set of G. In this paper, we characterize $$\alpha $$
α
-excellent bipartite graphs, $$\alpha $$
α
-excellent unicyclic graphs, $$\alpha $$
α
-excellent simplicial graphs, $$\alpha $$
α
-excellent chordal graphs, $$\alpha $$
α
-excellent block graphs, and we show that every generalized Petersen graph is $$\alpha $$
α
-excellent.
Funder
University of Johannesburg
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Berge, C.: Theory of Graphs and its Applications. Methuen, London (1962)
2. Berge, C.: Some common properties for regularisable graphs, edge-critical graphs and $$B$$-graphs. In: Saito, N., Nishiezeki, T. (eds.) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol. 108, pp. 108–123. Springer, New York (1981)
3. Berge, C.: Graphs. North-Holland, Amsterdam (1985)
4. Dettlaff, M., Henning, M. A., Topp, J.: Characterization of $$\alpha $$-excellent $$2$$-trees. arXiv:2210.14387
5. Dettlaff, M., Lemańska, M., Topp, J.: Common independence in graphs. Symmetry 13, 1411 (2021)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Characterization of \alpha-excellent 2-trees;Discussiones Mathematicae Graph Theory;2023