Contributions to the theory of domination, independence and irredundance in graphs
From MaRDI portal
Cites work
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3477211 (Why is no real title available?)
- scientific article; zbMATH DE number 3596896 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- On domination and independent domination numbers of a graph
- On the sum of cardinalities of extremum maximal independent sets
- Properties of Hereditary Hypergraphs and Middle Graphs
- Towards a theory of domination in graphs
Cited in
(60)- Dominating sets and domatic number of circular arc graphs
- On the sum of two parameters concerning independence and irredundance in a graph
- Two relations between the parameters of independence and irredundance
- On the product of upper irredundance numbers of a graph and its complement
- Chordal graphs and upper irredundance, upper domination and independence
- The product of the independent domination numbers of a graph and its complement
- On minimum maximal independent sets of a graph
- Minus domination in graphs
- On the differences between the upper irredundance, upper domination and independence numbers of a graph
- On independent domination number of regular graphs
- An upper bound for the independent domination number
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Domination and irredundance in cubic graphs
- Gallai-type theorems and domination parameters
- On weakly connected domination in graphs
- Irredundance in grids
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Interpolation theorems for graphs, hypergraphs and matroids
- Upper domination and upper irredundance perfect graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Domination and upper domination of direct product graphs
- The many facets of upper domination
- Inequalities relating domination parameters in cubic graphs
- Very well covered graphs
- Irredundance perfect graphs
- The algorithmic complexity of minus domination in graphs
- The complexity of irredundant sets parameterized by size
- Algorithmic aspects of upper edge domination
- Domination in fuzzy incidence graphs based on valid edges
- Weighted upper domination number
- Weighted irredundance of interval graphs.
- A boundary property for upper domination
- Upper domination: complexity and approximation
- A note on the independent domination number of subset graph
- Irredundance
- Domination in chessboards
- Common point domination number
- Dominating and irredundant broadcasts in graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- A study on regular domination in vague graphs with application
- Binary programming formulations for the upper domination problem
- THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM
- Graphs with equal Grundy domination and independence number
- Zero-divisor graphs of small upper irredundance number
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Indicated domination game
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Irredundancy in circular arc graphs
- A note on graphs which have upper irredundance equal to independence
- Upper domination: towards a dichotomy through boundary properties
- Independent domination, order, size, and maximum degree
- On the computational complexity of upper fractional domination
- The irredundance number and maximum degree of a graph
- Dominating sets for split and bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Ratios of some domination parameters in trees
- Extremal perfect graphs for a bound on the domination number
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
This page was built for publication: Contributions to the theory of domination, independence and irredundance in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157348)