Secure Total Domination in Rooted Product Graphs
In this article, we obtain general bounds and closed formulas for the secure total domination number of rooted product graphs. The results are expressed in terms of parameters of the factor graphs involved in the rooted product.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-04-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/4/600 |