Edge-recognizable domination numbers.

DOI10.1016/S0012-365X(03)00183-3zbMath1035.05061OpenAlexW2072579127MaRDI QIDQ1415542

Robert C. Brigham, Chao Gui, Ronald D. Dutton

Publication date: 4 December 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00183-3

zbMATH Keywords

\(k\)-dominationTotal dominationConnected dominationDistance-\(k\) dominationEdge-reconstructionPaired domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• A congruence theorem for trees
• On reconstructing graphs from their sets of subgraphs
• Bidegreed graphs are edge reconstructible
• Reconstruction of Trees
• Reconstructing Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-recognizable domination numbers.