The Private Neighbor Cube
From MaRDI portal
Recommendations
Cited in
(22)- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Using maximality and minimality conditions to construct inequality chains
- Enumeration of maximal irredundant sets for claw-free graphs
- Irredundance perfect graphs
- The complexity of irredundant sets parameterized by size
- Locally definable vertex set properties are efficiently enumerable
- Algorithmic aspects of upper edge domination
- Weighted irredundance of interval graphs.
- Irredundance
- The private neighbor concept
- Open packing number for some classes of perfect graphs
- Linear time algorithm for dominator chromatic number of trestled graphs
- Neighborhood representatives
- Enumeration of maximal irredundant sets for claw-free graphs
- A lower bound for the CO-irredundance number of a graph
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Zero-divisor graphs of small upper irredundance number
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Indicated total domination game
- On maximizing private neighbors in graphs
- Open irredundance and maximum degree in graphs
- The \(\langle t \rangle \)-property of some classes of graphs
This page was built for publication: The Private Neighbor Cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287938)
