Title

Edge-Recognizable Domination Numbers

Keywords

Connected domination; Distance-k domination; Edge-reconstruction; K-domination; Paired domination; Total domination

Abstract

For any undirected graph G, let script l sign(G) be the collection of edge-deleted subgraphs. It is always possible to construct a graph H from script l sign(G) so that script l sign(H)=script l sign(G). The general edge-reconstruction conjecture states that G and H must be isomorphic if they have at least four edges. A graphical invariant that must be identical for all graphs that can be constructed from the given collection is said to be edge-recognizable. Here we show that the domination number and many of its common variations are edge-recognizable. © 2003 Elsevier B.V. All rights reserved.

Publication Date

10-28-2003

Publication Title

Discrete Mathematics

Volume

272

Issue

1

Number of Pages

47-51

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/S0012-365X(03)00183-3

Socpus ID

0141973659 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0141973659

This document is currently not available here.

Share

COinS