CFP last date
20 June 2024
Reseach Article

Gracefulness of Building Graph of Level Five

by A.solairaju, T. Narppasalaiarasu
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 122 - Number 9
Year of Publication: 2015
Authors: A.solairaju, T. Narppasalaiarasu
10.5120/21728-4893

A.solairaju, T. Narppasalaiarasu . Gracefulness of Building Graph of Level Five. International Journal of Computer Applications. 122, 9 ( July 2015), 22-23. DOI=10.5120/21728-4893

@article{ 10.5120/21728-4893,
author = { A.solairaju, T. Narppasalaiarasu },
title = { Gracefulness of Building Graph of Level Five },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 122 },
number = { 9 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 22-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume122/number9/21728-4893/ },
doi = { 10.5120/21728-4893 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:10:07.200603+05:30
%A A.solairaju
%A T. Narppasalaiarasu
%T Gracefulness of Building Graph of Level Five
%J International Journal of Computer Applications
%@ 0975-8887
%V 122
%N 9
%P 22-23
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this article, the gracefulness of the building graph of level five is obtained.

References
  1. F. Harary, Graph Theory, Addison. Wesley, Reading. Mass (1969)
  2. J. A. Gallian, A dynamic survey of graph labeling, Electro. J. Combin. 15 (2008) #DS6.
  3. G. Ringel , Problem 25, in Theory of Graphs and its Applications, Proc. Symposium Smolenice 1963, Prague (1964) 162.
  4. A Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967) 349 – 355.
  5. S. W Golomb, How to number a graph, in Graph Theory and computing , R. C. Read, ed. Academic press, New York (1972) 23 – 27
  6. A. Solairaju, A. Sasikala, C. Vimala Gracefulness of a spanning tree of the graph of product of Pm and Cn, The Global Journal of Pure and Applied Mathematics of Mathematical Sciences, Vol. 1, No-2 (July-Dec 2008): 133-136
  7. A. Solairaju and K. Chitra Edge-odd graceful labeling of some graphs " Electronics Notes in Discrete Mathematics Volume 33,April 2009, Pages 15 – 20
  8. A. Solairaju, C. Vimala, A. Sasikala Gracefulness of a spanning tree of the graph of Cartesian product of Sm and Sn, The Global Journal of Pure and Applied Mathematics of Mathematical Sciences, Vol. 1, No-2 (July-Dec 2008): 117-120
  9. A. Solairaju, A. Sasikala, C. Vimala Edge-odd Gracefulness ofaspanningtreeofCartesianproductofP2andCninPacificsl of Mathematics, Vol . 3, No. 1-2. Jan-Dec. 2009, :39-42)
  10. A. Solairaju, C. Vimala, A. Sasikala Even Edge Gracefulness of the Graphs in Pacific-Asian Journal of Mathematics, Vol. 3, No. 1-2. Jan-Dec. 2009, :43-47)
Index Terms

Computer Science
Information Sciences

Keywords

Path circuit graph labeling Graceful graphs graceful numbering