Recommendations
Cites work
- \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs
- A four colorings theorem
- A linear algorithm for the domination number of a tree
- A note on graphs with open irratic number two
- A note on trees, tables, and algorithms
- A Roman domination chain
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An inequality chain of domination parameters for trees
- Broadcast irredundance in graphs
- Broadcasts in graphs
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 3859049 (Why is no real title available?)
- scientific article; zbMATH DE number 3869363 (Why is no real title available?)
- scientific article; zbMATH DE number 5073493 (Why is no real title available?)
- scientific article; zbMATH DE number 5777938 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 3549014 (Why is no real title available?)
- scientific article; zbMATH DE number 1208726 (Why is no real title available?)
- scientific article; zbMATH DE number 1208728 (Why is no real title available?)
- scientific article; zbMATH DE number 1229623 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2061808 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- scientific article; zbMATH DE number 866675 (Why is no real title available?)
- scientific article; zbMATH DE number 1416461 (Why is no real title available?)
- scientific article; zbMATH DE number 1416480 (Why is no real title available?)
- scientific article; zbMATH DE number 6180527 (Why is no real title available?)
- scientific article; zbMATH DE number 4189776 (Why is no real title available?)
- Induced matchings
- Irredundancy in circular arc graphs
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- Irredundant and perfect neighbourhood sets in trees
- Irredundant colorings of graphs
- Maximal irredundant functions
- On perfect neighborhood sets in graphs
- On the computational complexity of upper fractional domination
- On the equivalence of the upper open irredundance and fractional upper open irredundance numbers of a graph
- Open irredundance and maximum degree in graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Roman domination in graphs.
- The covering chain of a graph
- The Private Neighbor Cube
- Total irredundance in graphs
- Using maximality and minimality conditions to construct inequality chains
Cited in
(4)
This page was built for publication: The private neighbor concept
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384113)