1st International Conference on Environmental Geography and Geography Education | |
On local super h-decomposition antimagic total coloring of graphs | |
生态环境科学;地球科学 | |
Dini, R.P.^1^2 ; Dafik^1^2 ; Slamin^1^3 ; Agustin, I.H.^1^4 ; Adawiyah, R.^1^5 ; Alfarisi, R.^1^2 | |
CGANT-Research Group, University of Jember, Indonesia^1 | |
Departement of Mathematics Education University of Jember, University of Jember, Indonesia^2 | |
Departement of Information System University of Jember, Indonesia^3 | |
Departement of Mathematics, University of Jember, Indonesia^4 | |
Departement of Elementary School Teacher Education, University of Jember, Indonesia^5 | |
关键词: Bijections; Chromatic number; Cycle graphs; Edge-sets; Path graphs; Subgraphs; Total coloring; Vertex set; | |
Others : https://iopscience.iop.org/article/10.1088/1755-1315/243/1/012116/pdf DOI : 10.1088/1755-1315/243/1/012116 |
|
学科分类:环境科学(综合) | |
来源: IOP | |
【 摘 要 】
The writer introduces of local super H-decomposition antimagic total coloring of G. Let G(V, E) be a graph with vertex set V and edge set E. A bijection f : V(G) ∪ E(G) → {1, 2, 3, , |V(G)| + |E(G)|} is called a local H-decomposition antimagic total labeling for any two adjacent subgraph H 1 and H 2, wt (H 1) ≠ wt (H 2), where wt (H) = ∑v∈ V(H) f(v) + ∑e∈ E(H) f(e). Thus, any local super H-decomposition antimagic total labeling induces a proper subgraph coloring of G if each subgraph H is assigned by color wt (H). A coloring graph of local super H-decomposition antimagic total coloring is an assignment of colors minimum number. The colors minimum number of graphs namely is chromatic number, denoted by γ laH (G). In this paper, the writer studies the local super H-decomposition antimagic total coloring of graphs namely path graph, cycle graph, prims graph, and jahangir graph.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
On local super h-decomposition antimagic total coloring of graphs | 676KB | download |