$b$-Local Irregular Chromatic Number of Graphs
Abstract
In this paper, we study a new notation of coloring of graph, namely a $b$-local irregularity coloring. Suppose $l : V(G) \rightarrow \{1,2, \ldots ,k\}$ is called vertex irregular $k$-labeling and $w : V(G) \rightarrow N$, where $w(u) = \sum_{v \in N(u)} l(v)$. Every color class has a representative adjacent to at least one vertex in each of the color classes.$l$ is $b$-local irregularity coloring. The $b$-local irregular chromatic number denoted by $\chi_{b-lis}(G)$ is the largest of $k$ such that $G$ admits a $b$-local irregularity coloring. In this paper, we study the $b$-local irregular chromatic number of graphs namely path, cycle, star, friendship, complete, complete bipartite, and Wheel graph.
Published
2025-10-26
How to Cite
Kristiana, A. I., Alfarisi, R., Dafik, Husain, S. K. S., Mohanapriya, N., Basri, W., & Ponsathya, V. (2025). $b$-Local Irregular Chromatic Number of Graphs. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-2759
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).