The 2-domination number of cylindrical graphs
From MaRDI portal
Publication:2678854
DOI10.1007/s40314-022-02137-1OpenAlexW4311365876MaRDI QIDQ2678854
José Antonio Martínez, Ana Belén Castaño-Fernández, María Luz Puertas
Publication date: 25 January 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-02137-1
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Max-plus and related algebras (15A80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic solutions of tropical optimization problems
- Roman domination number of the Cartesian products of paths and cycles
- A note on tropical linear and integer programs
- Bounds on the 2-domination number
- Algebraic approach to fasciagraphs and rotagraphs
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
- A general lower bound for the domination number of cylindrical graphs
- A new framework to approach Vizing's conjecture
- Vizing's conjecture: a survey and recent results
- The Domination Number of Grids
- On the 2-domination Number of Cylinders with Small Cycles
- The 2-domination and Roman domination numbers of grid graphs
This page was built for publication: The 2-domination number of cylindrical graphs
