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

DOI10.1016/J.IPL.2018.01.012MaRDI QIDQ1707970zbMATH OpenOpenAlexFDO

Authors Yanamandram B. Venkatakrishnan, Balakrishna Krishnakumari

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

treetotal dominationcombinatorial problemsedge-vertex domination

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(16)

• Total edge-vertex domination
• The \(k\) edge-vertex domination problem
• On trees with total domination number equal to edge-vertex domination number plus one
• Edge-vertex domination on interval graphs
• Edge-vertex domination in trees
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
• A characterization of trees based on edge-deletion and its applications for domination-type invariants
• Vertex cover and edge-vertex domination in trees
• On the computation of extremal trees of Harmonic index with given edge-vertex domination number
• Bounds on the vertex-edge domination number of a tree
• Domination and edge domination in trees
• Bounds on total edge domination number of a tree
• Well ev-covered trees
• Bounds on the double edge-vertex domination number of a tree.
• Improved budgeted connected domination and budgeted edge-vertex domination
• On trees with domination number equal to edge-vertex Roman domination number

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)