Computation of Complete Partite k-Zumkeller Graphs
摘要
Let G = (V, E) be a simple graph with vertex set V and edge set E. The graph G is called a k-Zumkeller graph if it takes k-different Zumkeller numbers on the edges of E through a well-defined 1–1 function on the vertex set of G. In this chapter, the existence of k- Zumkeller graphs of complete bipartite, complete tripartite, and multipartite graph has been computed.