Introducing 3-path domination in graphs

DOI10.61091/jcmcc121-10MaRDI QIDQ6586650zbMATH OpenFDO

Authors Rayan Ibrahim, Rebecca Jackson, Erika L. C. King

Publication date 13 August 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61091/jcmcc121-10

zbMATH Keywords

3-pathdominating setNP-completeness

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The P₃-domination in graphs
• scientific article; zbMATH DE number 1506494
• Paired-domination in graphs
• \(H\)-domination in graphs
• 3-distance domination numbers of some graphs

Cites work

• scientific article; zbMATH DE number 1890833 (Why is no real title available?)
• Paired-domination in graphs

This page was built for publication: Introducing 3-path domination in graphs

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