Linear Separation of Dominating Sets in Graphs
From MaRDI portal
Publication:4154894
DOI10.1016/S0167-5060(08)70492-8zbMath0375.05043MaRDI QIDQ4154894
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Related Items
Threshold Sequences, About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs, Structure and recognition of domishold graphs, Multidimensional scaling and threshold graphs, Threshold Dimension of Graphs, Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2, Pseudodomishold graphs, Graphs and degree sequences. I, 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 \(f\)-domination: polyhedral and algorithmic results, Linear separation of connected dominating sets in graphs, On forcibly hereditary P-graphical sequences, Decomposing 1-Sperner hypergraphs, Eigenvalues and triangles in graphs, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), A class of threshold and domishold graphs: Equistable and equidominating graphs, Bibliography on domination in graphs and some basic definitions of domination parameters
