Published December 3, 2011 | Version v1

Mediate Dominating Graph of a Graph

Description

The graphs considered here are finite and simple. Let G = (V,E) be a graph and let the vertices and edges of a graph G be called the elements of G. The undefined terminology and notations can be found in [2].

Files

MediateDominatingGraph.pdf

Files (168.9 kB)

Name Size
md5:ac5cb5167d7dcb22d017ad14d3b7eee5
168.9 kB Preview Download