A class of threshold and domishold graphs: Equistable and equidominating graphs
DOI10.1016/0012-365X(90)90286-QzbMATH Open0542.05050MaRDI QIDQ795059FDOQ795059
Authors: Charles Payan 
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Equivalence dominating sets in graphs
- Equivalence domination in graphs
- On \(k\)-equivalence domination in graphs
- On some independent equitable domination of graphs
- On graphs with equal total domination and Grundy total domination numbers
- Characterization of some classes of graphs with equal domination number and isolate domination number
- On graphs with equal domination and connected domination numbers
- On graphs with equal total domination and connected domination numbers
dominating setsthreshold graphindependent setsforbidden induced subgraphsdomishold graphequidominatingequistable
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
Cited In (24)
- Short proofs on the structure of general partition, equistable and triangle graphs
- Strong cliques and equistability of EPT graphs
- Threshold graphs, shifted complexes, and graphical complexes
- Equistarable bipartite graphs
- Title not available (Why is that?)
- On equistable, split, CIS, and related classes of graphs
- Linear separation of connected dominating sets in graphs
- Complexity results for equistable graphs and related classes
- Strong cliques in diamond-free graphs
- Complement reducible 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
- Equistable series-parallel graphs
- Equistable chordal graphs
- Recognizing \(k\)-equistable graphs in FPT time
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- Computing well-covered vector spaces of graphs using modular decomposition
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- Equistable simplicial, very well-covered, and line graphs
- Equistable distance-hereditary graphs
- Decomposing 1-Sperner hypergraphs
- 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
This page was built for publication: A class of threshold and domishold graphs: Equistable and equidominating graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795059)
