On Edge-Balance Index Sets of the Graph CnxP6(n=3,4,5mod6)

Abstract:

Article Preview

Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2 = {0,1}. For a given binary edge labeling f :E(G)→Z2 , the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v) =1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to v , otherwise f*(v) is idefined. For i∈Z2 , let v(i)=card{v∈V(G): f*(v) =i} and e(i) = card{e∈E(G) : f (e)=i}. The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0) −v(1) |: the edge labeling f satisfies |e(0)−e(1) |≤1}.In this paper, we completely determine the edge-balance CnxP 6(n=3,4,5mod6).

Info:

Periodical:

Edited by:

Zhijiu Ai, Xiaodong Zhang, Yun-Hae Kim and Prasad Yarlagadda

Pages:

662-665

DOI:

10.4028/www.scientific.net/AMR.339.662

Citation:

Y. R. Ji et al., "On Edge-Balance Index Sets of the Graph CnxP6(n=3,4,5mod6)", Advanced Materials Research, Vol. 339, pp. 662-665, 2011

Online since:

September 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.