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

DOI10.1016/J.IPL.2018.01.012zbMATH Open1476.05161OpenAlexW2793144387MaRDI QIDQ1707970FDOQ1707970

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

Recommendations

• On trees with total domination number equal to edge-vertex domination number plus one
• Edge-vertex domination in trees
• Bounds on the double edge-vertex domination number of a tree.
• Total edge-vertex domination
• A lower bound on the total vertex-edge domination number of a tree

zbMATH Keywords

treetotal dominationcombinatorial problemsedge-vertex domination

Mathematics Subject Classification ID

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

Cites Work

• Total Domination in Graphs
• On trees with total domination number equal to edge-vertex domination number plus one
• A note on the total domination number of a tree

Cited In (12)

• On trees with domination number equal to edge-vertex roman domination number
• Edge-vertex domination in trees
• Well ev-covered trees
• The \(k\) edge-vertex domination problem
• On the computation of extremal trees of Harmonic index with given edge-vertex domination number
• Improved budgeted connected domination and budgeted edge-vertex domination
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
• Bounds on the vertex-edge domination number of a tree
• DOMINATION AND EDGE DOMINATION IN TREES
• Vertex cover and Edge vertex domination in trees
• Edge-vertex domination on interval graphs
• Total edge–vertex domination

This page was built for publication: An improved upper bound of edge-vertex domination number of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707970)