Let G∗ = (V, E) be a simple graph and A any nonempty set of parameters. subset R A×V an arbitrary relation from to V. mapping ᵖ(V) written as F:A → can defined F(x) { y ∈ V/xRy} ᵖ(E) K:A K(x) {uv E/{u, v} ⊆ F(x)}. The pair (F, A) is soft over V the (K, E. Obviously (F(a), K(a)) subgraph for all A. 4-tuple G ( G∗, F, K, called G. In this paper we discuss different graphs such Complete graph, Sta...
