Grundy Double Domination Number: Bounds, Graph Operations, and Efficient Computation for P4-Tidy Graphs | ||
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario | |
| dc.conicet.organizacion | Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática | |
| dc.contributor.author | Torres, Pablo Daniel | |
| dc.date.issued | 2026-02 | |
| dc.description.abstract | Inspired by graph domination games, various domination-type vertex sequences have been introduced, including the Grundy double dominating sequence (GDDS) of a graph and its associated parameter, the Grundy double domination number (GDDN). The decision version of the problem of computing the GDDN is known to be NPcomplete, even when restricted to split graphs and bipartite graphs. In this paper, we establish general tight bounds for the GDDN. We also describe GDDSs for vertexremoved graphs and for the join of two graphs. Applying these results, we prove that computing the GDDN is linear for P4-tidy graphs, thereby solving an open problem previously posed for cographs by B. Brešar et al. in [Brešar, B., Pandey, A., Sharma, G.: Computational aspects of some vertex sequences of grundy domination-type. Indian J. Discrete Math. 8, 21–38 (2022)]. | es |
| dc.description.fil | Fil: Torres, Pablo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas Ingeniería y Agrimensura. Escuela de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Torres, Pablo Daniel; Grundy Double Domination Number: Bounds, Graph Operations, and Efficient Computation for P4-Tidy Graphs; Springer; Bulletin Of The Malaysian Mathematical Sciences Society; 49; 2-2026; 1-19 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0126-6705 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/287914 | |
| dc.journal.ciudad | Berlín | es |
| dc.journal.pagination | 1-19 | es |
| dc.journal.pais | Alemania | es |
| dc.journal.title | Bulletin Of The Malaysian Mathematical Sciences Society | es |
| dc.journal.volume | 49 | es |
| dc.language.iso | eng | es |
| dc.publisher | Springer | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/10.1007/s40840-026-02055-z | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1007/s40840-026-02055-z | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | DOUBLE DOMINATING SEQUENCES | es |
| dc.subject | VERTEX DELETION | es |
| dc.subject | COGRAPHS | es |
| dc.subject | P_4-TIDY GRAPHS | es |
| dc.subject.classification | Otras Matemáticas | es |
| dc.subject.classification | Matemáticas | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Grundy Double Domination Number: Bounds, Graph Operations, and Efficient Computation for P4-Tidy Graphs | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.8feabfa8-8cae-463a-8e18-77026b288d59_B.pdf
- Tamaño:
- 420.84 KB
- Formato:
- Adobe Portable Document Format