Effect of edge-subdivision on vertex-domination in a graph
From MaRDI portal
Publication:4435568
DOI10.7151/DMGT.1179zbMATH Open1028.05072OpenAlexW2091354020MaRDI QIDQ4435568FDOQ4435568
Authors: Amitava Bhattacharya, G. R. Vijayakumar 
Publication date: 17 November 2003
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1179
Recommendations
Cited In (17)
- Influence of edge subdivision on the convex domination number
- Open packing subdivision number of graphs
- Changing and unchanging of the domination number of a graph: path addition numbers
- Critical graphs upon multiple edge subdivision
- Title not available (Why is that?)
- Bounding the total domination subdivision number of a graph in terms of its order
- Total domination and total domination subdivision number of a graph and its complement
- A new bound on the total domination subdivision number
- Disproof of a conjecture on the subdivision domination number of a graph
- Title not available (Why is that?)
- Domination subdivision numbers of trees
- Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
- Effect of an edge subdivision on game domination numbers
- Characterization of double domination subdivision number of trees
- Effects of edge lifting on domination in graphs
- Coronas and domination subdivision number of a graph
- Domination subdivision and domination multisubdivision numbers of graphs
This page was built for publication: Effect of edge-subdivision on vertex-domination in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435568)
