Radio Mean Labeling Algorithm, Its Complexity and Existence Results
Radio mean labeling of a connected graph <i>G</i> is an assignment of distinct positive integers to the vertices of <i>G</i> satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of <i>G</i> is called the <in...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/13/2057 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|