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: | Guzman-Garcia Emma, Sánchez-López Rocío |
---|---|
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 |
Similar Items
-
Independent Transversal Total Domination Versus Total Domination in Trees
by: Martínez Abel Cabrera, et al.
Published: (2021-02-01) -
On Independent Domination in Planar Cubic Graphs
by: Abrishami Gholamreza, et al.
Published: (2019-11-01) -
Making a Dominating Set of a Graph Connected
by: Li Hengzhe, et al.
Published: (2018-11-01) -
Dominating and total dominating partitions in cubic graphs
by: Southey Justin, et al.
Published: (2011-06-01) -
On [k] -Roman domination in graphs
by: N. Khalili, et al.
Published: (2023-09-01)