On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs (Q722058)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On (a,d)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs |
scientific article; zbMATH DE number 6909174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs |
scientific article; zbMATH DE number 6909174 |
Statements
On \((a,d)\)-distance anti-magic and 1-vertex bimagic vertex labelings of certain types of graphs (English)
0 references
20 July 2018
0 references
distance magic labeling
0 references
\((a, d)\)-distance antimagic labeling
0 references
1-vertex bimagic vertex labeling
0 references
\(n\)-dimensional cube
0 references
corona
0 references
0.84647536277771
0 references
0.8360157608985901
0 references
0.8138823509216309
0 references
0.8014955520629883
0 references
0.7975814342498779
0 references
