Chromatic number of super vertex local antimagic total labelings of graphs
Let G(V,E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, ..., |V|+|E|} where f(V)={1, 2, ..., |V|}. For a vertex x ∈ V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label itself. Then f is called a super vertex local antimagic total (SLAT) label...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |