Abstract
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 C4 with two disjoint paths of the same length attached at any two adjacent points is bi-graceful.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frank Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1972.
Joseph A. Gallian, A guide to the graph theory Zoo, Discrete applied mathematics, 49,213–229,1994.
Joseph A. Gallian, A dynamic survey of graph labeling, The eletronic J.combinatorics 5, # DS 6, 1–46, 1998.
J.C. Bermond, Graceful graphs, radio antennae and French Windmills. Proceedings of the one day combinatorics conference, Open University, Pitman, London, 18–37, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Basel AG
About this paper
Cite this paper
Murugan, M. (2002). Bi-Graceful Graphs. In: Agarwal, A.K., Berndt, B.C., Krattenthaler, C.F., Mullen, G.L., Ramachandra, K., Waldschmidt, M. (eds) Number Theory and Discrete Mathematics. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8223-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8223-1_24
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9481-4
Online ISBN: 978-3-0348-8223-1
eBook Packages: Springer Book Archive