Total and paired domination numbers of C_m bundles over a cycle C_n
DOI10.1007/S10878-015-9885-7zbMATH Open1343.05117OpenAlexW318757623MaRDI QIDQ306109FDOQ306109
Authors: Fu-Tao Hu, Moo Young Sohn, Xuegang Chen 
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Theory and Application of Graphs
- A survey of selected recent results on total domination in graphs
- Paired-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 the domination of Cartesian product of directed cycles: results for certain equivalence classes of lengths
- The domination number of grids
- Title not available (Why is that?)
- Title not available (Why is that?)
- On domination number of Cartesian product of directed paths
- Title not available (Why is that?)
- Isomorphism Classes of Graph Bundles
- Title not available (Why is that?)
- On domination number of Cartesian product of directed cycles
Cited In (4)
This page was built for publication: Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306109)
