On the minimum vertex covering transversal dominating sets in graphs and their classification

DOI10.1142/S1793830917500690zbMATH Open1386.05144MaRDI QIDQ4595258FDOQ4595258

Authors:

Publication date: 29 November 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Recommendations

• Vertex covering transversal domatic number of graphs
• scientific article; zbMATH DE number 1463390
• On the number of minimal dominating sets on some graph classes
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Finding a minimum dominating set by transforming domination of vertices
• On a class of vertex-transitive distance-regular covers of complete graphs
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• Transversal total domination in graphs
• scientific article; zbMATH DE number 4083674

zbMATH Keywords

minimum vertex covering transversal dominating setstrong \(r\)-cross \(\gamma_{\mathrm{vct}}\)-setvertex covering transversal domination numberweak \(r\)-cross \(\gamma_{\mathrm{vct}}\)-set

Mathematics Subject Classification ID

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

Cites Work

• Towards a theory of domination in graphs
• Independent transversal domination in graphs
• Theory of domination in graphs
• Vertex covering transversal domatic number of graphs

Cited In (3)

• \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
• Planar graphs without chordal 5-cycles are 2-good
• Vertex covering transversal domatic number of graphs

This page was built for publication: On the minimum vertex covering transversal dominating sets in graphs and their classification

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