Azarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21289120240301Simultaneous coloring of vertices and incidences of hypercubes67771461810.22049/cco.2023.27843.1367ENMahsa Mozafari-NiaDepartment of Mathematical Sciences, Shahid Beheshti University
G.C., P.O. Box 19839-63113, Tehran, IranMoharram N. IradmusaDepartment of Mathematical Sciences, Shahid Beheshti University
G.C., P.O. Box 19839-63113, Tehran, Iran0000-0003-0608-5781Journal Article20220524An element $i=(v,e)$ of a graph $G$ is called an incidence of $G$, if $v\in V(G)$, $e\in E(G)$ and $v\in e$. The simultaneous coloring of vertices and incidences of a graph is coloring the vertices and incidences of the graph properly at the same time such that any two adjacent or incident elements receive distinct colors. In this paper, we investigate the simultaneous coloring of vertices and incidences of hypercubes.https://comb-opt.azaruniv.ac.ir/article_14618_faa7a557f561944ebf780cd7170ff722.pdf