Linear Separation of Dominating Sets in Graphs
From MaRDI portal
Publication:4154894
DOI10.1016/S0167-5060(08)70492-8zbMATH Open0375.05043MaRDI QIDQ4154894FDOQ4154894
Authors: C. Benzaken, Peter L. Hammer 
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Cited In (19)
- Eigenvalues and triangles in graphs
- Pseudodomishold graphs
- Linear separation of connected dominating sets in graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Graphs obtained by disjoint unions and joins of cliques and stable sets
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- On \(f\)-domination: polyhedral and algorithmic results
- Multidimensional scaling and threshold graphs
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Graphs and degree sequences. I
- Decomposing 1-Sperner hypergraphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- On a class of graphs between threshold and total domishold graphs
- On forcibly hereditary P-graphical sequences
- Threshold Sequences
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- Structure and recognition of domishold graphs
- Threshold Dimension of Graphs
This page was built for publication: Linear Separation of Dominating Sets in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154894)
