Introducing 3-path domination in graphs

DOI10.61091/jcmcc121-10zbMath1545.05168MaRDI QIDQ6586650

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

Publication date: 13 August 2024

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

zbMATH Keywords

NP-completenessdominating set3-path

Mathematics Subject Classification ID

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

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