Global defensive alliances in the lexicographic product of paths and cycles

DOI10.1016/j.dam.2019.12.024zbMath1442.05186arXiv1810.08256WikidataQ126337839 ScholiaQ126337839MaRDI QIDQ2192075

Rommel M. Barbosa, Mitre C. Dourado, Leila R. S. da Silva

Publication date: 29 June 2020

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

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

zbMATH Keywords

cycle; path; lexicographic product; global defensive alliance

Mathematics Subject Classification ID

05C38: Paths and cycles

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C76: Graph operations (line graphs, products, etc.)

Cites Work

• Global defensive alliances of trees and Cartesian product of paths and cycles
• Partitioning a graph into defensive \(k\)-alliances
• On global offensive \(k\)-alliances in graphs
• Partitioning a graph into offensive \(k\)-alliances
• Boundary defensive \(k\)-alliances in graphs
• Global defensive \(k\)-alliances in graphs
• On the global offensive alliance number of a graph
• Offensive \(r\)-alliances in graphs
• Powerful alliances in graphs
• Defensive \(k\)-alliances in graphs
• Global defensive alliances in graphs
• Computing global offensive alliances in Cartesian product graphs
• Partitioning a graph into global powerful \(k\)-alliances
• Global offensive alliances in graphs
• Offensive alliances in graphs
• A survey on alliances and related parameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item