A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set

zbMATH Open1278.05174MaRDI QIDQ2869469

K. M. Koh, T. S. Ting, F. M. Dong

Publication date: 3 January 2014

Published in: (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (2)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A characterization of graphs with disjoint dominating and paired-dominating sets 👍 👎
• On cycles through prescribed vertices in weakly separable graphs 👍 👎
• A minimum degree result for disjoint cycles and forests in graphs 👍 👎
• On the existence of disjoint cycles in a graph 👍 👎
• Disjoint cycles and chorded cycles in a graph with given minimum degree 👍 👎
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets 👍 👎
• A characterization of graphs with disjoint total dominating sets 👍 👎
• Graphs with unique minimum specified domination sets 👍 👎

This page was built for publication: A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set

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