The Private Neighbor Concept
From MaRDI portal
Publication:3384113
DOI10.1007/978-3-030-58892-2_7zbMath1479.05273OpenAlexW3157885824MaRDI QIDQ3384113
Alice A. McRae, Stephen T. Hedetniemi, Raghuveer Mohan
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_7
Cites Work
- Irredundancy in circular arc graphs
- On the computational complexity of upper fractional domination
- Open irredundance and maximum degree in graphs
- A linear algorithm for the domination number of a tree
- Induced matchings
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- On perfect neighborhood sets in graphs
- Using maximality and minimality conditions to construct inequality chains
- Roman domination in graphs.
- Irredundant and perfect neighbourhood sets in trees
- Total irredundance in graphs
- Maximal irredundant functions
- \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs
- Broadcasts in graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- An inequality chain of domination parameters for trees
- The Private Neighbor Cube
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds
- A note on trees, tables, and algorithms
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- A Roman domination chain
- 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
This page was built for publication: The Private Neighbor Concept
