Square Sum Labeling for Pyramid Graph and Hanging Pyramid Graph


Abstract views: 8 / PDF downloads: 4

Authors

  • G. Subashini Research Scholar, Department of Mathematics, Mother Teresa Women’s University, Kodaikanal, Tamil Nadu, India
  • K. Ramanathan Department of Mathematics, KCG College of Engineering and Technology, Chennai, Tamil Nadu, India
  • K. Manimekalai Department of Mathematics, Bharath Institute of Higher Education and Research, Chennai, Tamil Nadu, India

Keywords:

Square sum labeling, Pyramid graph, Hanging Pyramid, One point union, Path union, BFS Algorithm

Abstract

In this paper we prove that square sum labeling for $Py_n$; $(n \geq 3)$, $HPy_n$, $P(r, Py_n)$, $P(r, HPy_n)$, one point union of $r$ copies of pyramid and hanging pyramid graphs are square sum graphs by using Breadth First Search Algorithm.

Downloads

Published

01-05-2018

How to Cite

G. Subashini, K. Ramanathan, & K. Manimekalai. (2018). Square Sum Labeling for Pyramid Graph and Hanging Pyramid Graph. International Journal of Mathematics And Its Applications, 6(1 (Special Issue), 97–102. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1401

Issue

Vol. 6 No. 1 (Special Issue) (2018)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.