Neighbor product distinguishing total colorings of corona of subcubic graphs
Hacettepe Journal of Mathematics and Statistics · 17.08.2026 · 55 (4) · 1658-1663
DOI: 10.15672/hujms.1764088 ↗Kurz gefasst
Fachartikel in der Zeitschrift Hacettepe Journal of Mathematics and Statistics, online erschienen am 17.08.2026. Verfasst von Aijun Dong und 2 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: School of Mathematics and Statistics.
Abstract (Originalsprache)
A proper $k$-total coloring $c$ of a graph $G$ is a mapping $c$from $V(G)\bigcup E(G)$ to $[k]=\{1,2,\cdots,k\}$ such that$c(x)\neq c(y)$ where $x$, $y\in V(G)\bigcup E(G)$ and $x$ isadjacent to or incident with $y$. Let $\prod(v)$ denote the product of $c(v)$ and the colors on all the edges incident with $v$. For each edge $uv\in E(G)$, if $\prod(u)\neq \prod(v)$, then the coloring $c$ is called a neighbor product distinguishing total coloring of $G$. By $\chi''_{\prod}(G)$, we denote the minimalvalue of $k$ in such a coloring of $G$. In this paper, we considered the corona graph $G$ of two arbitrary subcubic graphs and confirmed that $\chi''_{\prod}(G)\leq\Delta(G)+3$.
Förderung
- School of Mathematics and Statistics
Zitieren
APA
Dong, A., Zhang, W., & Xue, B. (2026). Neighbor product distinguishing total colorings of corona of subcubic graphs. Hacettepe Journal of Mathematics and Statistics, 55(4), 1658-1663. https://doi.org/10.15672/hujms.1764088
Vancouver
Dong A, Zhang W, Xue B. Neighbor product distinguishing total colorings of corona of subcubic graphs. Hacettepe Journal of Mathematics and Statistics. 2026;55(4):1658-1663. doi:10.15672/hujms.1764088
BibTeX
@article{Dong2026,
author = {Dong, Aijun and Zhang, Wenwen and Xue, Bing},
title = {Neighbor product distinguishing total colorings of corona of subcubic graphs},
journal = {Hacettepe Journal of Mathematics and Statistics},
year = {2026},
volume = {55},
number = {4},
pages = {1658--1663},
doi = {10.15672/hujms.1764088}
}
EUVIMED