On the Secure Total Domination Number of Graphs
A total dominating set <i>D</i> of a graph <i>G</i> is said to be a secure total dominating set if for every vertex <inline-formula> <math display="inline"> <semantics> <mrow> <mi>u</mi> <mo>∈</mo> <mi>...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-09-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/11/9/1165 |