SOME RESULTS OF LABELING ON BROOM GRAPH

DOI:

https://doi.org/10.24297/jam.v9i9.2239

Keywords:

Cordial labeling, Antimagic labeling, b-coloring.

Abstract

A Broom Graph Bn,d  is a graph of n vertices, which have a path P with d vertices and (n-d) pendant vertices, all of these being adjacent to either the origin u or the terminus v of the path P. Here we consider various labeling on Broom graph such as Cordial labeling, Antimagic labeling and b-coloring.

 

Downloads

Download data is not yet available.

Downloads

Published

2015-01-31

How to Cite

SOME RESULTS OF LABELING ON BROOM GRAPH. (2015). JOURNAL OF ADVANCES IN MATHEMATICS, 9(9), 3055–3061. https://doi.org/10.24297/jam.v9i9.2239

Issue

Section

Articles