On trees with total domination number equal to edge-vertex domination number plus one
DOI10.1007/S12044-016-0267-6zbMATH Open1338.05041OpenAlexW2329392816MaRDI QIDQ282302FDOQ282302
Authors: Marcin Krzywkowski, Balakrishna Krishnakumari, Yanamandram B. Venkatakrishnan
Publication date: 12 May 2016
Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12044-016-0267-6
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (13)
- Title not available (Why is that?)
- Edge-vertex domination in trees
- A note on complementary tree domination number of a tree
- Domination and edge domination in trees
- Vertex cover and edge-vertex domination in trees
- Title not available (Why is that?)
- On the computation of extremal trees of Harmonic index with given edge-vertex domination number
- On trees with domination number equal to edge-vertex Roman domination number
- Total edge-vertex domination
- Edge lifting and total domination in graphs
- Domination versus semipaired domination in trees
- An improved upper bound of edge-vertex domination number of a tree
- Edge-vertex domination on interval graphs
This page was built for publication: On trees with total domination number equal to edge-vertex domination number plus one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282302)