A characterization of locating-total domination edge critical graphs
From MaRDI portal
Publication:3171426
DOI10.7151/DMGT.1538zbMATH Open1284.05193OpenAlexW2040734094MaRDI QIDQ3171426FDOQ3171426
Authors: Mostafa Blidia, Widad Dali 
Publication date: 5 October 2011
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a69a46ad980bbcceb0bc6b7161d14de99dad352c
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (16)
- Optimal locating-total dominating sets in strips of height 3
- Domination parameters in hypertrees
- Local edge domination critical graphs
- Locating-total domination in graphs
- Bounding the locating-total domination number of a tree in terms of its annihilation number
- Progress towards the two-thirds conjecture on locating-total dominating sets
- Locating-total dominating sets in twin-free graphs: a conjecture
- On connected 3-\(\gamma_L\)-dot-critical graphs
- Location-domination in line graphs
- Title not available (Why is that?)
- Bounds on the locating-total domination number in trees
- On locating and locating-total domination edge addition critical graphs
- Domination parameters in hypertrees and sibling trees
- Locating-total domination critical graphs
- Bounds on the locating-domination number and differentiating-total domination number in trees
- Locating-total domination in grid graphs
This page was built for publication: A characterization of locating-total domination edge critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171426)
