Results on Total Restrained Domination number and subdivision number for certain graphs
From MaRDI portal
Publication:5069711
DOI10.1080/09720529.2014.995973zbMATH Open1495.05225OpenAlexW2278780149MaRDI QIDQ5069711FDOQ5069711
Authors: P. Jeyanthi, G. Hemalatha, Bijan Davvaz
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2014.995973
Cites Work
- Total domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Topics in graph theory. Graphs and their Cartesian product
- Total domination number of grid graphs
- Embedding of hypercubes into necklace, windmill and snake graphs
- On the total domination subdivision numbers of grid graphs
- Roman domination in Cartesian product graphs and strong product graphs
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Results on Total Restrained Domination number and subdivision number for certain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069711)