We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let G' be a copy of a graph G and let f : V (G) → V(G') be a function. A functigraph, denoted by C(G, f), is a graph with V (C(G, f )) = V(G) U V(G') and E(C(G, f )) = E(G) U E(G') U {uv : u ϵ V (G), v ϵ V (G'), v= f (u)}. Let χ(G) be the chromatic number of a graph. Recently, Chen et al. proved that χ(G) ≤(More)
  • 1