DECOMPOSITION OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS INTO COPIES OF P<sub>n</sub><sup>3</sup> or S<sub>2</sub>P<sub>n</sub><sup>3</sup> AND HARMONIOUS LABELING OF K<sub>2</sub>+ P<sub>n</sub>

P. Selvaraju (1) , G. Sethuraman (2)
(1) VEL TECH, India,
(2) Anna University, India
https://doi.org/10.22342/jims.0.0.23.109-122

Article Sidebar

Issue
Special Edition, Year 2011
Submitted
March 9, 2012
Accepted
March 9, 2012
Published
March 9, 2012
Keywords:
    &alpha, -labeling, harmonious labeling, P<sub>n</sub><sup>3 graphs, join, path.
ABSTRACT FULL PAPER

Abstract

Pdf Abstract

DOI : http://dx.doi.org/10.22342/jims.0.0.23.109-122

Full text article

Generated from XML file

Authors

P. Selvaraju
VEL TECH
author@jims-a.org (Primary Contact)
G. Sethuraman
Anna University
Selvaraju, P., & Sethuraman, G. (2012). DECOMPOSITION OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS INTO COPIES OF P<sub>n</sub><sup>3</sup> or S<sub>2</sub>P<sub>n</sub><sup>3</sup> AND HARMONIOUS LABELING OF K<sub>2</sub>+ P<sub>n</sub>. Journal of the Indonesian Mathematical Society, 109–122. https://doi.org/10.22342/jims.0.0.23.109-122
Download Citation
Endnote/Zotero/Mendeley (RIS) BibTeX
Copyright and license info is not available

Article Details

Crossref
Scopus
Google Scholar
Europe PMC