Properties of Hereditary Hypergraphs and Middle Graphs
From MaRDI portal
Cited in
(78)- On the ratios between packing and domination parameters of a graph
- On the product of upper irredundance numbers of a graph and its complement
- Some inequalities about connected domination number
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Irredundance number versus domination number
- Minus domination in graphs
- On the differences between the upper irredundance, upper domination and independence numbers of a graph
- 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
- Using maximality and minimality conditions to construct inequality chains
- Irredundance in grids
- Domination by queens on a square beehive
- Stratification and domination in graphs
- Independence and upper irredundance in claw-free graphs
- Relations between the lower domination parameters and the chromatic number of a graph.
- Iterated colorings of graphs.
- Interpolation theorems for domination numbers of a graph
- Inequalities relating domination parameters in cubic graphs
- Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
- Irredundance perfect graphs
- Well irredundant graphs
- Maximal irredundant functions
- Coalescence and criticality of graphs
- New bounds for the broadcast domination number of a graph
- Irredundance graphs
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- On graph fall-coloring: existence and constructions
- Extremal graphs for a new upper bound on domination parameters in graphs
- Extended chain of domination parameters in graphs
- Unique irredundance, domination and independent domination in graphs
- Irredundance trees of diameter 3
- On the complexity landscape of the domination chain
- A Characterization of the extended DII-sequence
- Isolate domination in graphs
- Irredundant ramsey numbers for graphs
- Irredundance
- The private neighbor concept
- Models of domination in graphs
- Roman domination in graphs
- Outer-connected independence in graphs
- THE IRREDUNDANT RAMSEY NUMBER s(3,6)
- Irredundant ramsey numbers for graphs
- A semi-induced subgraph characterization of upper domination perfect graphs
- On \((r, s)\)-fuzzy domination in fuzzy graphs
- Min-max and max-min graph saturation parameters
- The edge signal number of a graph
- Independent partial domination
- Dominating and irredundant broadcasts in graphs
- On \(\mathcal{F}\)-domination in graphs
- The enclaveless competition game
- A lower bound for the CO-irredundance number of a graph
- Vertex sequences in graphs
- Vertex-edge domination in graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- A Roman domination chain
- Recognizing well-dominated graphs is coNP-complete
- Zero-divisor graphs of small upper irredundance number
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Towards a new framework for domination
- The irredundance-related Ramsey numbers s(3,8)=21 and w(3,8)=21
- A new look at the concept of domination in hypergraphs
- Irredundancy in circular arc graphs
- A note on graphs which have upper irredundance equal to independence
- Bounds for irredundant and co-irredundant Ramsey numbers
- Minority sets in graphs
- On the maximum weighted irredundant set problem
- TAR reconfiguration for vertex set parameters
- Zero forcing irredundant sets
- On the outer-independent total (Roman) domination number of some graph operators
- Majority sets in graphs
- On maximizing private neighbors in graphs
- The irredundance number and maximum degree of a graph
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Queen's domination using border squares and \((A,B)\)-restricted domination
This page was built for publication: Properties of Hereditary Hypergraphs and Middle Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175592)
