New Bounds for Three Outer-Independent Domination-Related Parameters in Cactus Graphs
Let <i>G</i> be a nontrivial connected graph. For a set <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>D</mi><mo>⊆</mo><mi>V</mi><mo>(</mo>&...
Main Authors: | Abel Cabrera-Martínez, Juan Manuel Rueda-Vázquez, Jaime Segarra |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-03-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/13/3/177 |
Similar Items
-
On the Outer-Independent Double Roman Domination of Graphs
by: Yongsheng Rao, et al.
Published: (2021-02-01) -
Outer-Independent Italian Domination in Graphs
by: Wenjie Fan, et al.
Published: (2019-01-01) -
Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees
by: Zepeng Li, et al.
Published: (2018-01-01) -
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
by: Hong Gao, et al.
Published: (2022-09-01) -
An upper bound on the total outer-independent domination number of a tree
by: Marcin Krzywkowski
Published: (2012-01-01)