From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs
Let <i>G</i> be a graph with no isolated vertex and let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>(</mo><mi>v</mi><mo>)</mo>&...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-07-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/13/7/1282 |