• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Journal of Algorithms and Computation
Articles in Press
Current Issue
Journal Archive
Volume Volume 51 (2019)
Volume Volume 50 (2018)
Volume Volume 49 (2017)
Volume Volume 48 (2016)
Volume Volume 47 (2016)
Volume Volume 46 (2015)
Volume Volume 45 (2014)
Issue Issue 1
December 2014, Page 1-20
Volume Volume 44 (2013)
Volume Volume 43 (2009)
Volume Volume 42 (2008)
Volume Volume 41 (2007)
Jeyanthi, P., Saratha Devi, T. (2014). Edge pair sum labeling of spider graph. Journal of Algorithms and Computation, 45(1), 25-34.
P. Jeyanthi; T. Saratha Devi. "Edge pair sum labeling of spider graph". Journal of Algorithms and Computation, 45, 1, 2014, 25-34.
Jeyanthi, P., Saratha Devi, T. (2014). 'Edge pair sum labeling of spider graph', Journal of Algorithms and Computation, 45(1), pp. 25-34.
Jeyanthi, P., Saratha Devi, T. Edge pair sum labeling of spider graph. Journal of Algorithms and Computation, 2014; 45(1): 25-34.

Edge pair sum labeling of spider graph

Article 3, Volume 45, Issue 1, December 2014, Page 25-34  XML PDF (732.19 K)
Document Type: Research Paper
Authors
P. Jeyanthi email 1; T. Saratha Devi2
1Research Centre, Department of Mathematics, Govindammal Aditanar College for Women Tiruchendur, Tamil Nadu, India.
2Department of Mathematics, G. Venkataswamy Naidu College, Kovilpatti, Tamil Nadu, India.
Abstract
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} according as p is even
or odd. A graph which admits edge pair sum labeling is called an edge pair sum graph. In this paper we exhibit some spider graph.
Keywords
Edge pair sum labeling; edge pair sum graph; spider graph
Statistics
Article View: 1,335
PDF Download: 1,329
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

This work is licensed under a Creative Commons Attribution 4.0 International License
Journal Management System. Designed by sinaweb.