Some network topological notions of the Mycielskian of a graph

Properties of Partial Complement Mycielskian Graph u (G)

“…that cover all edges of ‫ܩ‬[1,2,3,4,6,7,9]. A circuit ‫ܥ‬ in a graph ‫ܩ‬ is said to be an Eulerian circuit if ‫ܥ‬ contains every edge of ‫.ܩ‬ A connected graph that contains an Eulerian circuit is called an Eulerian graph.…”