Adiga, Chandrashekar and Subbaraya, C. K. and Shrikanth, A. S. and Sriraj, M. A.
(2013)
*On vertex balance index set of some graphs.*
Bulletin of the Iranian Mathematical Society, 39 (4).
pp. 627-634.

Text (Full Text)
Math_2013_Adiga_01.pdf - Published Version Restricted to Registered users only Download (299kB) | Request a copy |

## Abstract

Let Z2 = {0, 1} and G = (V, E) be a graph. A labeling f : V −→ Z2 induces an edge labeling f ∗ : E −→ Z2 defined by f ∗ (uv) = f(u).f(v). For i ∈ Z2, let vf (i) = v(i) = card{v ∈ V : f(v) = i} and ef (i) = e(i) = card{e ∈ E : f ∗ (e) = i}. A labeling f is said to be vertex-friendly if | v(0)−v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper we completely determine the vertex balance index set of Kn, Km,n, Cn × P2 and Complete binary tree.

Item Type: | Article |
---|---|

Subjects: | E Mathematical Science > Mathematics |

Divisions: | Department of > Mathematics |

Depositing User: | Arshiya Kousar Library Assistant |

Date Deposited: | 11 Sep 2019 05:38 |

Last Modified: | 08 Jul 2022 10:59 |

URI: | http://eprints.uni-mysore.ac.in/id/eprint/7838 |

### Actions (login required)

View Item |