Corrigendum to: Independent Transversal Domination in Graphs [Discuss. Math. Graph Theory 32 (2012) 5–17]
In [Independent transversal domination in graphs, Discuss. Math. Graph Theory 32 (2012) 5–17], Hamid claims that if G is a connected bipartite graph with bipartition {X, Y } such that |X| ≤ |Y| and |X| = γ(G), then γit(G) = γ(G) + 1 if and only if every vertex x in X is adjacent to at least two pend...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2297 |