Elegant Labeling of Some Graphs
An elegant labeling on graph G with vertices and edges is an injective (one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers f0; 1; 2; 3; :::; g in such a way that the set of values on the edges obtained by the sums mod + 1 of the labels of their end vertices is f1;...
Saved in:
Main Authors: | PRIHANDINI, Rafiantika Megahnia (Author), DAFIK, Dafik (Author), AGUSTIN, Ika Hesti (Author), ALFARISI, Ridho (Author), ADAWIYAH, Robiatul (Author) |
---|---|
Format: | Academic Paper |
Published: |
Journal of Physics: Conference Series,
2021-05-03T04:10:44Z.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Families of Tree Are Elegant
by: PRIHANDINI, Rafiantika Megahnia, et al.
Published: (2021) -
On the rainbow coloring for some graph operations
by: Dafik, Dafik, et al.
Published: (2018) -
On Super Local Antimagic Total Edge Coloring of Some Wheel Related Graphs
by: Agustin, Ika Hesti, et al.
Published: (2018) -
On the Local Multiset Dimension of Graph With Homogenous Pendant Edges
by: ADAWIYAH, Robiatul, et al.
Published: (2021) -
LOCAL EDGE ANTIMAGIC COLORING OF GRAPHS
by: Agustin, Ika Hesti, et al.
Published: (2018)