An improved upper bound of edge-vertex domination number of a tree
From MaRDI portal
Publication:1707970
DOI10.1016/J.IPL.2018.01.012zbMATH Open1476.05161OpenAlexW2793144387MaRDI QIDQ1707970FDOQ1707970
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
Recommendations
Cites Work
Cited In (16)
- Bounds on the double edge-vertex domination number of a tree.
- Edge-vertex domination in trees
- Domination and edge domination in trees
- Bounds on total edge domination number of a tree
- Well ev-covered trees
- On trees with total domination number equal to edge-vertex domination number plus one
- The \(k\) edge-vertex domination problem
- Vertex cover and edge-vertex domination in trees
- On the computation of extremal trees of Harmonic index with given edge-vertex domination number
- A characterization of trees based on edge-deletion and its applications for domination-type invariants
- Improved budgeted connected domination and budgeted edge-vertex domination
- On trees with domination number equal to edge-vertex Roman domination number
- Total edge-vertex domination
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
- Bounds on the vertex-edge domination number of a tree
- Edge-vertex domination on interval graphs
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)
