Pillai, K. Mathevan (57191840760) and Mahesh, M. S. (57191851730) and Selvam, Govindaraj (57450857600) (2016) Non spit two out degree equitable domination number in graphs.
Full text not available from this repository.Abstract
Let G=(V,E) be a undirected graph. A dominating D of G is said to two out degree equitable dominating set if for any two vertices u,vϵ D such that |od <inf>D</inf>(u)-od<inf>D</inf>(v)|≤2 where od<inf>D</inf>(u)=| N(v)∩V-D?|. The minimum cardinality of two out degree equitable dominating set is called two out degree equitable domination number and it is donated by γ<inf>2ar</inf>(G). In this paper non split two out degree equitable domination in graph is introduced and studied. AMS Classification: 05C9. © 2017 Elsevier B.V., All rights reserved.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematics |
| Divisions: | Arts and Science > School of Arts and Science, Chennai > Mathematics |
| Depositing User: | Unnamed user with email techsupport@mosys.org |
| Last Modified: | 11 Dec 2025 06:06 |
| URI: | https://vmuir.mosys.org/id/eprint/4820 |
Actions (login required)
- View Item