On the Total Version of Triple Roman Domination in Graphs
In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from <inline-formula><math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>{</mo>&l...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/8/1277 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from <inline-formula><math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>}</mo></mrow></semantics></math></inline-formula> to the vertices of a graph such that every vertex is protected by at least three units either on itself or its neighbors while ensuring that none of its neighbors remains unprotected. Formally, a total triple Roman dominating function is a function <inline-formula><math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>}</mo></mrow></semantics></math></inline-formula> such that <inline-formula><math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>f</mi><mo>(</mo><mi>N</mi><mo>[</mo><mi>v</mi><mo>]</mo><mo>)</mo><mo>≥</mo><mo stretchy="false">|</mo><mi>A</mi><mi>N</mi><mo>(</mo><mi>v</mi><mo>)</mo><mo stretchy="false">|</mo><mo>+</mo><mn>3</mn></mrow></semantics></math></inline-formula>, where <inline-formula><math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>A</mi><mi>N</mi><mo>(</mo><mi>v</mi><mo>)</mo></mrow></semantics></math></inline-formula> denotes the set of active neighbors of vertex <i>v</i>, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families. |
|---|---|
| ISSN: | 2227-7390 |