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: | , , , , |
---|---|
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!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |