Independent domination versus packing in subcubic graphs

DOI10.1016/J.DAM.2024.06.007MaRDI QIDQ6611014zbMATH OpenFDO

Authors Eun-Kyung Cho, Min-Ki Kim

Publication date 26 September 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.06.007

zbMATH Keywords

independent domination numberpacking numbersubcubic graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Independent domination in subcubic graphs
• Independent domination in cubic graphs
• Dominating sets, packings, and the maximum degree
• Domination versus independent domination in cubic graphs

Cites work

• A tight bound for independent domination of cubic graphs without 4‐cycles
• Chiraptophobic cockroaches evading a torch light.
• Dominating sets, packings, and the maximum degree
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• On domination and independent domination numbers of a graph
• On independent domination of regular graphs
• On packing and covering numbers of graphs
• Orientable convexity, geodetic and hull numbers in graphs

Cited in

(5)

• On the independent semitotal domination in lexicographic product graphs
• A graph theoretical approach to optimizing minimum Italian domination sets
• Domination number, independent domination number and k-independence number in trees
• On independent domination and packing numbers of subcubic graphs
• Independent domination, order, size, and maximum degree

This page was built for publication: Independent domination versus packing in subcubic graphs

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