On rainbow vertex antimagic coloring and its application on STGNN time series forecasting on subsidized diesel consumption
Let G = (V, E) be a simple, connected and un-directed graph. We introduce a new notion of rainbow vertex antimagic coloring. This is a natural expansion of rainbow vertex coloring combined with antimagic labeling. For f: E(G) → 1, 2,…, |E(G)|, the weight of a vertex v ∈ V (G) against f is wf (v) = Σ...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
International Association of Engineers
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/113568/1/113568.pdf http://psasir.upm.edu.my/id/eprint/113568/ https://www.iaeng.org/IJAM/issues_v54/issue_5/IJAM_54_5_22.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|