Raheem, Abdul
(COMSATS Institute of Information Technology, Islamabad, 2016)
Construction of Magic and Anti-magic Graphs
An undirected graph G is said to be simple if it has no multi-edges and self-loops. If G
is connected and has no cycles, it is called a tree. A labeling of a graph is a ...