Linear separation of total dominating sets in graphs

DOI10.1007/978-3-642-45043-3_15MaRDI QIDQ2864299zbMATH OpenOpenAlexFDO

Authors Nina Chiarelli, Martin Milanič

Publication date 6 December 2013

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45043-3_15

zbMATH Keywords

total domishold graphs

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
• On a class of graphs between threshold and total domishold graphs
• Linear separation of connected dominating sets in graphs
• Partitioning the vertices of a graph into two total dominating sets
• scientific article; zbMATH DE number 1805967

Cited in

(5)

• Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
• On a class of graphs between threshold and total domishold graphs
• Linear separation of connected dominating sets in graphs
• Line-set domination in graphs

This page was built for publication: Linear separation of total dominating sets in graphs

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