An improved upper bound of edge-vertex domination number of a tree

DOI10.1016/j.ipl.2018.01.012zbMath1476.05161OpenAlexW2793144387MaRDI QIDQ1707970

Balakrishna Krishnakumari, Yanamandram B. Venkatakrishnan

Publication date: 4 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.01.012

zbMATH Keywords

treecombinatorial problemstotal dominationedge-vertex domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination ⋮ Vertex cover and Edge vertex domination in trees ⋮ On the computation of extremal trees of Harmonic index with given edge-vertex domination number ⋮ Edge-vertex domination in trees ⋮ DOMINATION AND EDGE DOMINATION IN TREES ⋮ Improved budgeted connected domination and budgeted edge-vertex domination ⋮ Total edge–vertex domination ⋮ On trees with domination number equal to edge-vertex roman domination number

Cites Work

• Unnamed Item
• On trees with total domination number equal to edge-vertex domination number plus one
• Total Domination in Graphs