The Private Neighbor Concept
type: Item
instance of: scholarly article
title: The Private Neighbor Concept
zbMATH Open document ID: 1479.05273
DOI: 10.1007/978-3-030-58892-2_7
author: Stephen T. Hedetniemi
author: Alice A. McRae
author: Raghuveer Mohan
published in: Developments in Mathematics
publication date: 2021-12-14T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7444903
zbMATH Keywords: private neighbor
zbMATH Keywords: minimal dominating set
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-58892-2 7
OpenAlex ID: W3157885824
cites work: Q3328474
cites work: Open irredundance and maximum degree in graphs
cites work: Broadcast irredundance in graphs
cites work: A note on graphs with open irratic number two
cites work: The covering chain of a graph
cites work: Q3206969
cites work: Induced matchings
cites work: Q3089219
cites work: A Roman domination chain
cites work: On the computational complexity of upper fractional domination
cites work: Q4943510
cites work: Q4457557
cites work: Generalised irredundance in graphs: Nordhaus-Gaddum bounds
cites work: Q4943531
cites work: A linear algorithm for the domination number of a tree
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Q4211755
cites work: Using maximality and minimality conditions to construct inequality chains
cites work: An inequality chain of domination parameters for trees
cites work: Q4222090
cites work: Irredundant and perfect neighbourhood sets in trees
cites work: Roman domination in graphs.
cites work: Q3581685
cites work: Q5753985
cites work: Broadcasts in graphs
cites work: Q4821947
cites work: Q3337494
cites work: Irredundant and perfect neighborhood sets in graphs and claw-free graphs
cites work: Total irredundance in graphs
cites work: The Private Neighbor Cube
cites work: Q3691778
cites work: Maximal irredundant functions
cites work: On perfect neighborhood sets in graphs
cites work: Q3410863
cites work: Q2960958
cites work: Q3270978
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: A note on trees, tables, and algorithms
cites work: Irredundancy in circular arc graphs
cites work: Q4368728
cites work: Q3621535
cites work: Q3791195
cites work: Q4873694
cites work: Q4211753
cites work: Q4123349
cites work: \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs
cites work: Q5298905
description: scientific article; zbMATH DE number 7444903