Vertex Equitable Labeling of Cyclic Snakes and Bistar Graphs

Authors

  • P. Jeyanthi Govindammal Aditanar College for Women,
  • A. Maheswari Kamaraj College of Engineering andTechnology, Virudhunagar,Tamilnadu

DOI:

https://doi.org/10.3329/jsr.v6i1.15044

Keywords:

Vertex equitable labeling, Vertex equitable graph.

Abstract

Let G be a graph with p vertices and q edges and let A = {0, 1, 2,..., }.
A vertex labeling f: V (G) ® A induces an edge labeling f * defined by f *(uv) = f(u) + f(v) for all edges uv. For , let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, and the induced edge labels are 1, 2, 3,, q. In this paper, we establish vertex equitable labeling of square graph of and splitting graph of and kC4 snake(k?1) and the generalized kCn snake is vertex equitable if nº0(mod4),n?4.

 

Keywords: Vertex equitable labeling; Vertex equitable graph.

 

© 2014 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.

 

doi: http://dx.doi.org/10.3329/jsr.v6i1.15044 J. Sci. Res. 6 (1), 79-85 (2014)

 

Downloads

Download data is not yet available.
Abstract
245
PDF
302

Author Biographies

P. Jeyanthi, Govindammal Aditanar College for Women,

Principal and Head

Research Centre,
Department of Mathematics,
Govindammal Aditanar College for Women,
Tiruchendur-628 215, India

A. Maheswari, Kamaraj College of Engineering andTechnology, Virudhunagar,Tamilnadu

Assistant Professor

Department of Mathematics,

Kamaraj College of Engineering and Technology,

Virudhunagar, India

Downloads

Published

2013-12-26

How to Cite

Jeyanthi, P., & Maheswari, A. (2013). Vertex Equitable Labeling of Cyclic Snakes and Bistar Graphs. Journal of Scientific Research, 6(1), 79–85. https://doi.org/10.3329/jsr.v6i1.15044

Issue

Section

Section A: Physical and Mathematical Sciences