Irredundance
From MaRDI portal
Publication:3384112
DOI10.1007/978-3-030-58892-2_6OpenAlexW4211098021MaRDI QIDQ3384112
No author found.
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_6
Related Items
Cites Work
- Triangulations and equality in the domination chain
- A lower bound for the CO-irredundance number of a graph
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- A note on \(\gamma\)-graphs
- Preperfect graphs
- Irredundancy in circular arc graphs
- A note on graphs which have upper irredundance equal to independence
- The irredundance number and maximum degree of a graph
- Irredundance, secure domination and maximum degree in trees
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Open irredundance and maximum degree in graphs
- On the ratios between packing and domination parameters of a graph
- A note on total domination
- On graphs having domination number half their order
- 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
- Contributions to the theory of domination, independence and irredundance in graphs
- Chessboard domination problems
- Chordal graphs and upper irredundance, upper domination and independence
- Irredundance number versus domination number
- On the differences between the upper irredundance, upper domination and independence numbers of a graph
- A note on the irredundance number after vertex deletion
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Domination and irredundance in cubic graphs
- Gallai-type theorems and domination parameters
- Domination and irredundance in the queens' graph
- Irredundance in grids
- The rati of the irredundance and domination number of a graph
- A lower bound for irredundant Ramsey numbers
- Locally well-dominated and locally independent well-dominated graphs
- Independence and upper irredundance in claw-free graphs
- Relations between the lower domination parameters and the chromatic number of a graph.
- On upper domination Ramsey numbers for graphs.
- Upper domination and upper irredundance perfect graphs
- A characterization of \(\Gamma\alpha(k)\)-perfect graphs
- A disproof of Henning's conjecture on irredundance perfect graphs
- An improved upper bound for queens domination numbers
- Changing upper irredundance by edge addition
- Inequalities relating domination parameters in cubic graphs
- A new lower bound on upper irredundance in the queens' graph
- Independence, irredundance, degrees and chromatic number in graphs
- Irredundance and domination in kings graphs
- Irredundance perfect graphs
- Well irredundant graphs
- Coalescence and criticality of graphs
- Nordhaus-Gaddum results for CO-irredundance in graphs
- Extremal graphs for a new upper bound on domination parameters in graphs
- The domination parameters of cubic graphs
- Vertex criticality for upper domination and irredundance
- On the Complexity Landscape of the Domination Chain
- The mixed irredundant Ramsey numberst(3, 7) = 18 andt(3, 8) = 22
- γ-graphs of graphs
- On equality in an upper bound for domination parameters of graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- THE IRREDUNDANT RAMSEY NUMBER s(3,6)
- A lower bound for the irredundance number of trees
- Stability, domination and irredundance in a graph
- Domination-balanced graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Irredundant ramsey numbers for graphs
- A semi-induced subgraph characterization of upper domination perfect graphs
- Irredundance perfect andP6-free graphs
- The ratio of the irredundance number and the domination number for block-cactus graphs
- Irredundance in inflated graphs
- The Private Neighbor Cube
- ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
- The irredundant ramsey number s(3,3,3) = 13
- The irredundant ramsey number s(3, 7)
- Irredundance and Maximum Degree in Graphs
- CO-irredundant Ramsey numbers for graphs
- A note on some variations of the $\gamma$-graph
- Mixed Ramsey Numbers Revisited
- Asymptotic bounds for irredundant and mixed Ramsey numbers
- Linear-time computation of optimal subgraphs of decomposable graphs
- Proof of a conjecture on irredundance perfect graphs
- On domination and annihilation in graphs with claw-free blocks
- Domination parameters and edge-removal-critical graphs
- Values of domination numbers of the queen's graph
- The upper domination Ramsey number \(u(3,3,3)\)
- Inflated graphs with equal independence number and upper irredundance number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
