English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The $b$-chromatic number of a graph $G$, denoted by $b(G)$, is the largestpositive integer $k$ such that there exists a proper coloring for G with $k$colors in which every color class contains at least one vertex adjacent to somevertex in each of the other color classes, such a vertex is called a dominantvertex. The $f$-chromatic vertex number of a $d$-regular graph $G$, denoted by$f(G)$, is the maximum number of dominant vertices of distinct colors in aproper coloring with $d+1$ colors. El Sahili and Kouider conjectured that$b(G)=d+1$ for any $d$-regular graph $G$ of girth 5. We study this conjectureby giving some partial answers under supplementary conditions.

The $b$-Chromatic Number and $f$-Chromatic Vertex Number of Regular Graphs