Name
Abstract | ||
|---|---|---|
A set D of vertices in a graph G - (V (G); E (G)) is an open neighborhood locating-dominating set (OLD - set) for G if for every two vertices u, v of V (G) the sets N (u) boolean AND D and N (v) boolean AND D are non-empty and different. The open neighborhood locating- dominating number OLD (G) is the minimum cardinality of an OLD - set for G. In this paper, we characterize graphs G of order n with OLD (G) = 2, 3, or n and graphs with minimum degree delta(G) >= 2 that are C-4-free with OLD (G) = n - 1. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.5614/ejgta.2014.2.2.1 | ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS |
Keywords | Field | DocType |
domination, open neighborhood locating-dominating | Discrete mathematics,Graph,Combinatorics,Bound graph,Vertex (geometry),Cardinality,Mathematics | Journal |
Volume | Issue | ISSN |
2 | 2 | 2338-2287 |
Citations | PageRank | References |
1 | 0.38 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mustapha Chellali | 1 | 188 | 38.24 |
| Nader Jafari Rad | 2 | 58 | 33.09 |
| suk j seo | 3 | 1 | 0.38 |
| Peter J. Slater | 4 | 593 | 132.02 |