Name
Abstract | ||
|---|---|---|
For a graph G that models a facility or a multiprocessor network, detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur or a faulty processor. Open neighborhood locating-dominating sets are of interest when the intruder/fault at a vertex precludes its detection at that location. The parameter OLD(G) denotes the minimum cardinality of a vertex set S@?V(G) such that for each vertex v in V(G) its open neighborhood N(v) has a unique non-empty intersection with S. For a tree T"n of order n we have @?n/2@?+1@?OLD(T"n)@?n-1. We characterize the trees that achieve these extremal values. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2010.12.010 | Discrete Applied Mathematics |
Keywords | Field | DocType |
order n,domination,open neighborhood,multiprocessor network,open neighborhood locating–dominating set,extremal value,graph g,faulty processor,minimum cardinality,detection device,parameter old,vertex v,dominating set,extreme value | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Cardinality,Multiprocessor network,Mathematics | Journal |
Volume | Issue | ISSN |
159 | 6 | Discrete Applied Mathematics |
Citations | PageRank | References |
17 | 0.96 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suk J. Seo | 1 | 19 | 2.36 |
| Peter J. Slater | 2 | 593 | 132.02 |