A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Entire Dominating Transformation Graphs and Fuzzy Transformation Graphs

2015
*
Intern. J. Fuzzy Mathematical Archive
*
unpublished

Let G=(V, E) be a graph. Let S be the set of all minimal dominating sets of G. Let x, y, z be three variables each taking value + or-. The entire transformation graph G xyz is the graph having V∪S as the vertex set and for any two vertices u and v in V ∪ S, u and v are adjacent in G xyz if and only if one of the following conditions holds: (i) u, v ∈ V. x = + if u, v ∈D where D is a minimal dominating set of G. x =-if u, v ∉ D where D is a minimal dominating set of G. (ii) u, v ∈ S. y = + if u

fatcat:xh4bqn45ezbineanmghpndqb7i