| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 490063 | Procedia Computer Science | 2015 | 5 Pages |
Abstract
The minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersection graph on the minimum eccentric dominating sets of G. In this paper minimum eccentric dominating graph of some families of graphs are studied.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
