Well irredundant graphs
From MaRDI portal
Publication:1917235
DOI10.1016/0166-218X(94)00073-9zbMath0846.05051MaRDI QIDQ1917235
Jerzy Topp, Preben Dahl Vestergaard
Publication date: 7 July 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
bipartite graphschordal graphsdominatingclosed neighbourhoodirredundance numberswell irredundant graphs
Related Items (6)
Graphs with maximal induced matchings of the same size ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Triangulations and equality in the domination chain ⋮ Certified domination ⋮ Graphs with equal domination and covering numbers ⋮ Irredundance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gallai theorems for graphs, hypergraphs, and set systems
- On graphs having domination number half their order
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Towards a theory of domination in graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- WELL-COVERED GRAPHS: A SURVEY
- Two Bounds for the Domination Number of a Graph
- Well covered simplicial, chordal, and circular arc graphs
- Some covering concepts in graphs
This page was built for publication: Well irredundant graphs
