Extremal Problems in Royal Colorings of Graphs

zbMATH Open1466.05061arXiv1909.12690MaRDI QIDQ4995320

Author name not available (Why is that?)

Publication date: 23 June 2021

Abstract: An edge coloring $c$ of a graph $G$ is a royal $k$-edge coloring of $G$ if the edges of $G$ are assigned nonempty subsets of the set $1,2,ldots,k$ in such a way that the vertex coloring obtained by assigning the union of the colors of the incident edges of each vertex is a proper vertex coloring. If the vertex coloring is vertex-distinguishing, then $c$ is a strong royal $k$-edge coloring. The minimum positive integer $k$ for which $G$ has a strong royal $k$-edge coloring is the strong royal index of $G$. It has been conjectured that if $G$ is a connected graph of order $nge4$ where $2^{k-1}lenle{2}^k-1$ for a positive integer $k$, then the strong royal index of $G$ is either $k$ or $k+1$. We discuss this conjecture along with other information concerning strong royal colorings of graphs. A sufficient condition for such a graph to have a strong royal index $k+1$ is presented.

Full work available at URL: https://arxiv.org/abs/1909.12690

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Extremal Problems in Royal Colorings of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995320)