Total domination in inflated graphs
DOI10.1016/J.DAM.2011.08.012zbMATH Open1237.05151OpenAlexW2045481823MaRDI QIDQ765350FDOQ765350
Authors: Michael A. Henning, A. P. Kazemi 
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.012
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Irredundance in inflated graphs
- Inflated graphs with equal independence number and upper irredundance number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination in inflated graphs
Cited In (6)
- The lower domination parameters in inflation of graphs of radius 1
- Paired-domination in inflated graphs
- Total domination in \(K_r\)-covered graphs
- A note on the \(k\)-tuple total domination number of a graph
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Relating the annihilation number and the total domination number for some graphs
This page was built for publication: Total domination in inflated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765350)
