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 <inline-formula><math xmlns="http://www.w3...
Tallennettuna:
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
MDPI AG
2025-06-01
|
| Sarja: | Mathematics |
| Aiheet: | |
| Linkit: | https://www.mdpi.com/2227-7390/13/13/2057 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|