b – Coloring of Extended Duplication Graph of Dragon graph(Tn,1) and Sunlet graph(Sn) Networks

Authors

  • C. Shobana Sarma

Keywords:

b-coloing, middle graph, total graph, extended duplication graph, Dragon, Sunlet

Abstract

The b – chromatic number ????(????), is the highest k for which G confess a b-coloring by k colors. A b-coloring of G by k colors is proper vertex k-coloring such that in each color class i there is a vertex ???????? having neighbors in every other k − 1 color classes. In this article we obtain b – chromatic number of (M[EDG(Tn,1)]) middle graph of extended duplication graph of Dragon graph, middle graph of extended duplicate graph of Sunlet graph (M[EDG(Sn)]), and total graph of (T[EDG(Tn,1)]) extended duplication graph of Dragon graph and total graph of extended duplicate graph of Sunlet graph T[EDG(Sn)].

 

Downloads

Published

2025-09-16

How to Cite

C. Shobana Sarma. (2025). b – Coloring of Extended Duplication Graph of Dragon graph(Tn,1) and Sunlet graph(Sn) Networks. Utilitas Mathematica, 122(2), 1053–1059. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/2817

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.