b-Coloring of the Mycielskian of Some Classes of Graphs
The b-chromatic number b(G) of a graph G is the maximum k for which G has a proper vertex coloring using k colors such that each color class contains at least one vertex adjacent to a vertex of every other color class. In this paper, we have mainly investigated on the b-chromatic number of the Mycie...
-д хадгалсан:
| Үндсэн зохиолчид: | , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
University of Zielona Góra
2022-05-01
|
| Цуврал: | Discussiones Mathematicae Graph Theory |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://doi.org/10.7151/dmgt.2265 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|