Total Domination on Some Graph Operators
Let <inline-formula><math display="inline"><semantics><mrow><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></semantics></math></inl...
Main Author: | José M. Sigarreta |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/3/241 |
Similar Items
-
On the Quasi-Total Roman Domination Number of Graphs
by: Abel Cabrera Martínez, et al.
Published: (2021-11-01) -
On the Total k-Domination in Graphs
by: Bermudo Sergio, et al.
Published: (2018-02-01) -
Secure Total Domination in Rooted Product Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-04-01) -
Total Domination in Rooted Product Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-11-01) -
From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs
by: Ana Almerich-Chulia, et al.
Published: (2021-07-01)