On b-coloring of central graph of some graphs
dc.contributor.author | Kalpana, M. | |
dc.contributor.author | Vijayalakshmi, D. | |
dc.contributor.department | Other | tr_TR |
dc.contributor.faculty | Other | tr_TR |
dc.date.accessioned | 2021-11-03T12:29:53Z | |
dc.date.available | 2021-11-03T12:29:53Z | |
dc.date.issued | 2019-02-01 | |
dc.description.abstract | The b-chromatic number of G, denoted by ϕ(G), is the maximum k for which G has a b-coloring by k colors. A b-coloring of G by k colors is a proper k-coloring of the vertices of G such that in each color class i there exists a vertex x_{i} having neighbors in all the other k-1 color classes. Such a vertex x_{i} is called a b-dominating vertex, and the set of vertices {x₁,x₂…x_{k}} is called a b-dominating system. In this paper, we are going to investigate on the b-chromatic number of Central graph of Triangular Snake graph, Sunlet graph, Helm Graph, Double Triangular Snake graph, Gear graph, and Closed Helm graph are denoted as C(T_{n}), C(S_{n}), C(H_{n}), C(DT_{n}), C(G_{n}), C(CH_{n}) respectively. | tr_TR |
dc.description.index | Trdizin | tr_TR |
dc.identifier.endpage | 1239 | tr_TR |
dc.identifier.issn/e-issn | 2618-6470 | |
dc.identifier.issue | 1 | tr_TR |
dc.identifier.startpage | 1229 | tr_TR |
dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.516089 | tr_TR |
dc.identifier.uri | http://hdl.handle.net/20.500.12575/75874 | |
dc.identifier.volume | 68 | tr_TR |
dc.language.iso | en | tr_TR |
dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
dc.relation.isversionof | 10.31801/cfsuasmas.516089 | tr_TR |
dc.relation.journal | Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics | tr_TR |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | tr_TR |
dc.subject | b-coloring | tr_TR |
dc.subject | b-chromatic number | tr_TR |
dc.subject | central graph | tr_TR |
dc.title | On b-coloring of central graph of some graphs | tr_TR |
dc.type | Article | tr_TR |