Chordal graphs and upper irredundance, upper domination and independence
From MaRDI portal
Publication:1174126
DOI10.1016/0012-365X(90)90349-MzbMath0744.05063OpenAlexW2057711397MaRDI QIDQ1174126
Michael S. Jacobson, Ken Peters
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90349-m
Related Items (36)
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs ⋮ Enumeration of maximal irredundant sets for claw-free graphs ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Irredundance perfect graphs ⋮ Domination and irredundance in cubic graphs ⋮ Gallai-type theorems and domination parameters ⋮ The algorithmic complexity of minus domination in graphs ⋮ Weighted upper domination number ⋮ THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM ⋮ On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Zero-divisor graphs of small upper irredundance number ⋮ The many facets of upper domination ⋮ Formalization of the Domination Chain with Weighted Parameters (Short Paper) ⋮ In)approximability of Maximum Minimal FVS ⋮ Irredundancy in circular arc graphs ⋮ A note on graphs which have upper irredundance equal to independence ⋮ The \(k\)-dominating graph ⋮ Upper domination: towards a dichotomy through boundary properties ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ Algorithmic aspects of upper paired-domination in graphs ⋮ The total irredundance numbers on graphs ⋮ Algorithmic aspects of upper edge domination ⋮ (In)approximability of maximum minimal FVS ⋮ Irredundance ⋮ A Boundary Property for Upper Domination ⋮ Upper Domination: Complexity and Approximation ⋮ Inequalities relating domination parameters in cubic graphs ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Minus domination in graphs ⋮ Upper domination and upper irredundance perfect graphs ⋮ Interpolation theorems for domination numbers of a graph ⋮ On the differences between the upper irredundance, upper domination and independence numbers of a graph ⋮ Weighted irredundance of interval graphs. ⋮ The sequence of upper and lower domination, independence and irredundance numbers of a graph ⋮ Closure systems and their structure ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination and independent domination numbers of a graph
- Contributions to the theory of domination, independence and irredundance in graphs
- Split Domination, Independence, and Irredundance in Graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Dominating Sets in Chordal Graphs
- `` Strong NP-Completeness Results
- Towards a theory of domination in graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Two Bounds for the Domination Number of a Graph
This page was built for publication: Chordal graphs and upper irredundance, upper domination and independence
