Bounds on total edge domination number of a tree
From MaRDI portal
Publication:5012811
DOI10.1142/S1793830921500117zbMATH Open1475.05141OpenAlexW3082160599MaRDI QIDQ5012811FDOQ5012811
Yanamandram B. Venkatakrishnan, H. Naresh Kumar, B. Senthilkumar
Publication date: 25 November 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500117
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the vertex-edge domination number of a tree
- Lower bound on the domination number of a tree
- A lower bound on the total outer-independent domination number of a tree
- The complexity of total edge domination and some related results on trees
Cited In (11)
- Total domination on tree operators
- Bounds of the sum of edge lengths in linear arrangements of trees
- Bounds on the number of edges in hypertrees
- The complexity of total edge domination and some related results on trees
- Title not available (Why is that?)
- On trees attaining an upper bound on the total domination number
- Algorithms and hardness results for edge total domination problem in graphs
- Bounds on the locating-total domination number in trees
- Bounds on the differentiating-total domination number of a tree
- Bounds on the vertex-edge domination number of a tree
- Edge-vertex domination on interval graphs
This page was built for publication: Bounds on total edge domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012811)
