The minimum equitable domination energy of a graph

Rajendra, P. and Rangarajan, R. (2015) The minimum equitable domination energy of a graph. International Journal of Mathematical Combinatorics, 3. pp. 62-72.

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


A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex u . D such that uv . E(G) and |deg(u) - deg(v)| = 1, where deg(u) denotes the degree of vertex u and deg(v) denotes the degree of vertex v. Recently, The minimum covering energy Ec(G) of a graph is introduced by Prof. C. Adiga, and co-authors 1. Motivated by 1, in this paper we define energy of minimum equitable domination EED(G) of some graphs and we obtain bounds on EED(G). We also obtain the minimum equitable domination determinant of some graph G given by detED(G) = µ1µ2 . . . µn where µ1, µ2, . . . , µn are eigenvalues of AED(G).

Item Type: Article
Uncontrolled Keywords: Minimum Equitable Domination Set and Spectrum of Minimum Equitable Domination Matrix and Energy of Minimum Equitable Domination and Determinant of Minimum Equitable Domination matrix.
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: Users 19 not found.
Date Deposited: 26 Jun 2019 06:55
Last Modified: 26 Jun 2019 06:55

Actions (login required)

View Item View Item