Diophantine Edge Graceful Graph

Swaminathan A. Mariadoss, Sunita D' Silva · Recent Advances in Computer Science and Communications · 2015

Background: Graph labeling problems have interesting applications in coding theory, communication networks, optimal circuits’ layouts and graph decomposition problems, as described in various patents. Keywords: Diophantine edge graceful, complete (m, h) trees, corona of graphs.

Read the paper · More papers on PaperTik