On perfect neighborhood sets in graphs

DOI10.1016/S0012-365X(98)00306-9zbMATH Open0928.05047OpenAlexW2005145220MaRDI QIDQ1297450FDOQ1297450

Authors: Gerd H. Fricke, Teresa W. Haynes, Michael A. Henning, Sandra M. Hedetniemi, Stephen T. Hedetniemi 

Publication date: 9 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00306-9

Recommendations

• scientific article; zbMATH DE number 1186103
• scientific article
• Domination number and neighbourhood conditions
• Upper domination and upper irredundance perfect graphs
• On graphs with no proper perfect dominating set

zbMATH Keywords

numerical invariantsupper domination numberperfect neighbourhood setupper perfect neighbourhood number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Irredundant and perfect neighbourhood sets in trees
• Title not available (Why is that?)

Cited In (12)

• Nearest-neighbor graphs on the cantor set
• Title not available (Why is that?)
• Title not available (Why is that?)
• 1-Triangle graphs and perfect neighborhood sets
• The private neighbor concept
• Irredundant and perfect neighbourhood sets in trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On classes of neighborhood resolving sets of a graph
• Neighbourhood-perfect line graphs
• Title not available (Why is that?)
• \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs

This page was built for publication: On perfect neighborhood sets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297450)