E-Total Coloring of Complete Bipartite Graphs <i>K</i><sub>5,</sub><i><sub>n</sub></i> (5≤<i>n</i>≤7 113) Which Are Vertex-Distinguished by Multiple Sets
In this study, using the method of contradiction and the pre-assignment of chromatic sets, we discuss the E-total coloring of complete bipartite graphs K 5, n (5≤ n ≤7 113) which are vertex-distinguished by multiple sets. The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined.
Authors
- Xiang'en CHEN
- Yaqin GUO
Institutions
- Northwest Normal University (CN)
Publication Details
- Journal
- Wuhan University Journal of Natural Sciences
- Published
- 2024-10-01
- DOI
- https://doi.org/10.1051/wujns/2024295412
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China