Grundy dominating sequences on \(X\)-join product

DOI10.1016/j.dam.2020.03.016zbMath1443.05151arXiv1810.02737OpenAlexW3011998649MaRDI QIDQ777371

Pablo Torres, Graciela L. Nasini

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.02737

zbMATH Keywords

split graphspowers of cycles\(X\)-join productGrundy dominating sequencespowers of paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On the L-Grundy domination number of a graph ⋮ On the length of L-Grundy sequences ⋮ Graphs with equal Grundy domination and independence number ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ Grundy domination and zero forcing in regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sequences in grid-like and toroidal graphs
• Trapezoid graphs and generalizations, geometry and algorithms
• Dominating sequences in graphs
• Graph derivatives
• On maximal independent sets of vertices in claw-free graphs
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• On the structure of graphs with few \(P_4\)s
• Grundy dominating sequences and zero forcing sets
• On the Grundy number of graphs with few \(P_4\)'s
• Linear time solvable optimization problems on graphs of bounded clique-width
• Zero forcing sets and the minimum rank of graphs
• Sur le joint d'une famille de graphes
• ON GRAPHS WITH LIMITED NUMBER OF P₄-PARTNERS
• Efficient algorithms for graphs with few \(P_4\)'s

This page was built for publication: Grundy dominating sequences on \(X\)-join product