Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)
From MaRDI portal
Publication:306109
DOI10.1007/s10878-015-9885-7zbMath1343.05117OpenAlexW318757623MaRDI QIDQ306109
Xue-gang Chen, Fu-Tao Hu, Moo Young Sohn
Publication date: 31 August 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9885-7
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination number of Cartesian product of directed paths
- On domination number of Cartesian product of directed cycles
- A survey of selected recent results on total domination in graphs
- Total domination number of grid graphs
- Edge-colorability of graph bundles
- Dominating Cartesian products of cycles
- Domination number of Cartesian products of directed cycles
- The domination number of Cartesian product of two directed paths
- Total and paired domination numbers of toroidal meshes
- On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths
- The Domination Number of Grids
- Total domination in graphs
- Theory and Application of Graphs
- Paired-domination in graphs
- Isomorphism Classes of Graph Bundles
This page was built for publication: Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)
