Alliance free sets in Cartesian product graphs
From MaRDI portal
Publication:2446344
DOI10.1016/j.dam.2013.01.011zbMath1287.05129arXiv1112.2068WikidataQ57974320 ScholiaQ57974320MaRDI QIDQ2446344
Sergio Bermudo, Juan Alberto Rodríguez-Velázquez, Ismael González Yero
Publication date: 16 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.2068
05C62: Graph representations (geometric and intersection representations, etc.)
05C76: Graph operations (line graphs, products, etc.)
Cites Work
- An improved inequality related to Vizing's conjecture
- Partitioning a graph into defensive \(k\)-alliances
- On global offensive \(k\)-alliances in graphs
- A note on the partition dimension of Cartesian product graphs
- The Menger number of the Cartesian product of graphs
- Partitioning a graph into offensive \(k\)-alliances
- On the geodetic number and related metric sets in Cartesian product graphs
- On the global offensive alliance number of a graph
- Partitioning a graph into alliance free sets
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- A result on Vizing's conjecture
- An inequality related to Vizing's conjecture
- Computing global offensive alliances in Cartesian product graphs
- Alliance free and alliance cover sets
- The alliance partition number of grid graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- Vizing's conjecture: a survey and recent results
- On the Metric Dimension of Cartesian Products of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item