On the b-Chromatic Number of Graphs

@inproceedings{Kratochvl2002OnTB,
  title={On the b-Chromatic Number of Graphs},
  author={Jan Kratochv{\'i}l and Zsolt Tuza and Margit Voigt},
  booktitle={WG},
  year={2002}
}
The purpose of this study is to compute the b-chromatic number of central graph of star graph n K , 1 and Multi star Graphs ) , ( 2 s n a a K and ) , , ( 3 t r n a a a K .More Specifically, for any star graph , )] ( [ , 1 n K C n   for any double star graph 1 ))] , ( ( [ 2    r n a a K C r n  and for the triple star graph, 1 ))] , , ( ( [ 3     t r n a a a K C t r n  . Also find out the bchromatic number of central graph of Fire cracker graph and Banana tree graph. 

From This Paper

Figures, tables, and topics from this paper.
42 Citations
3 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-3 of 3 references

On the Number of Spanning trees of Multistar Related Graphs

  • Nikipoulos, S.D, P. Rondogiannis
  • Volume
  • 1998

Operations of Interlaced Trees and Graceful Trees.

  • W. C. Chen, H. I. Lü, Y. N. Yeh
  • South East Asian Bull. Math
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…