Upper bounds for [1,2]-domination number in trees

DOI10.22049/CCO.2026.31357.2831MaRDI QIDQ7323600zbMATH OpenFDO

Authors J. Amjadi, Mohammad Ali Ebadi, Seyed Mahmood Sheikholeslami, Lutz Volkmann

Publication date 1 September 2026

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2026.31357.2831

Mathematics Subject Classification ID

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

Cites work

• \([1,2]\)-sets in graphs
• Fair domination in graphs
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• Perfect and quasiperfect domination in trees

This page was built for publication: Upper bounds for \([1,2]\)-domination number in trees

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