Bi-Graceful Graphs
M. Murugan · Birkhäuser Basel eBooks · 2002
A graph G is said to be bi-graceful if both G and its line graph L(G) are graceful. In this paper we study bi-graceful graphs and prove that C 4 with two disjoint paths of the same length attached at any two adjacent points is bi-graceful.