Neighborhood connected equitable domination in graphs

Sivakumar, S. and Soner, N. D. and Alwardi, A. (2012) Neighborhood connected equitable domination in graphs. Applied Mathematical Sciences, 6 (49-52). pp. 2445-2452. ISSN 1312-885X

[img] Text (Full Text)
Neighborhood Connected Equitable Domination in Graphs.pdf - Published Version
Download (95kB)
Official URL: http://www.m-hikari.com/ams/ams-2012/ams-49-52-201...

Abstract

Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhood connected equitable dominating set (nced-set) if the induced subgraph �Ne(S)� is connected The minimum cardinality of a nced-set of G is called the neighborhood connected equitable domination number of G and is denoted by ãnce(G). In this paper we initiate a study of this parameter. For any graph G

Item Type: Article
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: C Swapna Library Assistant
Date Deposited: 28 Aug 2019 06:27
Last Modified: 28 Aug 2019 06:27
URI: http://eprints.uni-mysore.ac.in/id/eprint/7222

Actions (login required)

View Item View Item
uomeprints is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.