Distance neighbourhood domination in graphs

Janakiram, B. and Davis, M. A. and Soner, N. D. (2009) Distance neighbourhood domination in graphs. National Academy Science Letters-India, 32 (9-10). pp. 287-290. ISSN 0250-541X

Full text not available from this repository. (Request a copy)


A set S of vertices in a graph G = (V, E) is said to be a k-distance neighbourhood dominating set, if G = U(v is an element of S) < N(k)v] >, The k-distance neighbourhood domination number is the minimum cardinality of a k-distance neighbourhood dominating set of G and is denoted by n(k)(G). In this communication, besides obtaining some bounds on n(k)(G), some interesting results on n(k)(G), characterizations of k-distance neighbourhood dominating set and minimal k-distance neighbourhood dominating set are obtained.

Item Type: Article
Uncontrolled Keywords: Graph; Domination; Distance neighbourhood domination in graphs
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: Users 19 not found.
Date Deposited: 31 Aug 2019 05:21
Last Modified: 31 Aug 2019 05:21
URI: http://eprints.uni-mysore.ac.in/id/eprint/7418

Actions (login required)

View Item View Item