Balance Index Set of Caterpillar and Lobster Graphs

Bhat, Pradeep G and Nayak, Devadas C (2016) Balance Index Set of Caterpillar and Lobster Graphs. International journal of Mathematics combin, 3. pp. 123-135. ISSN 1937 -1055

[img] PDF
1273.pdf - Published Version
Restricted to Registered users only

Download (236kB) | Request a copy
Official URL:


Let G be a graph with vertex set V (G) and edge set E(G). Consider the set A = {0, 1}. 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 ∈ E(G). For i ∈ A, let vf (i) = |{v ∈ V (G) : f(v) = i}| and ef∗(i) = |{e ∈ E(G) : f∗(e) = i}|. A labeling f of a graph G is said to be friendly if |vf (0) − vf (1)| ≤ 1. A friendly labeling is balanced if |ef∗ (0)−ef∗(1)| ≤ 1. The balance index set of the graph G,BI(G), is defined as {|ef∗ (0) − ef∗(1)| : the vertex labeling f is friendly}. In this paper, we obtain the balance index set of caterpillar graphs and lobster graphs.

Item Type: Article
Uncontrolled Keywords: Friendly labeling, Smarandache friendly labeling, partial edge labeling and balance index set.
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 17 Oct 2016 09:20
Last Modified: 17 Oct 2016 09:20

Actions (login required)

View Item View Item