The minimum efficient dominating energy of some graphs

Authors

  • K. Deepika and S. Meenakshi

Keywords:

Dominating Set, efficient Dominating Set, Efficient Dominating Matrix, Minimum Efficient Dominating Set.

Abstract

Let G= (n,m) be a simple graph. The energy of the graph is defined as the sum of the absolute values of the eigen values of
the adjacency matrix. The total π electron energy of conjugated hydrocarbon moleculesare closely connected with graph
invariant. Recently based on the eigen values of graph matrices various energies are computed. For a graph matrix, we can
determine the eigen values based on which we can compute the energy of the graph. In this paper we computed the efficient
dominating energy of coconut tree CT (n,1), Pineapple graphK3,3,K3,4 Helm graph H4and Friendship graphF3,
F4.

Downloads

Published

19191919-April04-2727

Issue

Section

Articles