Balanced Labeling and Balance Index Set of One Point Union of Two Complete Graphs

Bhat , Pradeep G and Nayak , Devadas C (2012) Balanced Labeling and Balance Index Set of One Point Union of Two Complete Graphs. International Journal of Computer Applications, 52 (13). ISSN 0975 - 8887

[img] PDF
P.G.BHAT_AND_DEVADAS_NAYAK_C_2.pdf
Restricted to Registered users only

Download (209kB) | Request a copy
Official URL: http://www.ijcaonline.org/archives/volume52/number...

Abstract

Let G be a graph with vertex set V (G) and edge set E(G), and consider the set A = f0; 1g. A labeling f : V (G) ! A induces a partial edge labeling f� : E(G) ! A defined by f�(xy) = f(x), if and only if f(x) = f(y), for each edge xy 2 E(G). For i 2 A, let vf (i) = jfv 2 V (G) : f(v) = igj and ef� (i) = je 2 E(G) : f�(e) = ij. A labeling f of a graph G is said to be friendly if jvf (0)

Item Type: Article
Uncontrolled Keywords: Vertex labeling, Friendly labeling, Cordial labeling, Balanced labeling and Balance index set.
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 18 Feb 2013 06:51
Last Modified: 18 Feb 2013 06:51
URI: http://eprints.manipal.edu/id/eprint/78524

Actions (login required)

View Item View Item