Stability, domination and irredundance in a graph
From MaRDI portal
Publication:3752424
DOI10.1002/jgt.3190100402zbMath0612.05056OpenAlexW2122837462MaRDI QIDQ3752424
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100402
Related Items (22)
An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Irredundance perfect graphs ⋮ Domination and irredundance in cubic graphs ⋮ Claw-free graphs---a survey ⋮ Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Construction of trees and graphs with equal domination parameters ⋮ Irredundance number versus domination number ⋮ Unnamed Item ⋮ On graphs with equal domination and independent domination numbers ⋮ Irredundancy in circular arc graphs ⋮ On the Complexity Landscape of the Domination Chain ⋮ The total irredundance numbers on graphs ⋮ Automated generation of conjectures on forbidden subgraph characterization ⋮ Irredundance ⋮ On the ratios between packing and domination parameters of a graph ⋮ Irredundant and perfect neighborhood sets in graphs and claw-free graphs ⋮ Unique irredundance, domination and independent domination in graphs ⋮ The sequence of upper and lower domination, independence and irredundance numbers of a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Stability, domination and irredundance in a graph
