On trees with total domination number equal to edge-vertex domination number plus one

DOI10.1007/S12044-016-0267-6zbMATH Open1338.05041OpenAlexW2329392816MaRDI QIDQ282302FDOQ282302

Balakrishna Krishnakumari, Yanamandram B. Venkatakrishnan, Marcin Krzywkowski

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

• An improved upper bound of edge-vertex domination number of a tree
• Edge-vertex domination in trees
• Total edge-vertex domination
• Vertex cover and edge-vertex domination in trees
• Total vertex-edge domination in trees

zbMATH Keywords

treetotal dominationedge-vertex domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Title not available (Why is that?)
• On trees with domination number equal to edge-vertex roman domination number
• 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
• DOMINATION AND EDGE DOMINATION IN TREES
• Domination versus semipaired domination in trees
• Vertex cover and Edge vertex domination in trees
• An improved upper bound of edge-vertex domination number of a tree
• Edge-vertex domination on interval graphs
• Total edge–vertex domination

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)