Edge-magic trees (Q1860738)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1874468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-magic trees |
scientific article; zbMATH DE number 1874468 |
Statements
Edge-magic trees (English)
0 references
20 May 2003
0 references
A graph \(G=(V,E)\) is edge-magic when there exists a bijection from the vertices and edges of \(G\) to the set of numbers \(\{1,2\ldots, |V|+|E|\}\) such that for each edge, the sum of its label and the labels of its endpoints is a constant. This paper shows that paths and star graphs are edge-magic.
0 references
edge-magic labelings
0 references
trees
0 references
0.88672674
0 references
0.8508414
0 references
0.84807163
0 references
0.8451002
0 references
0.8395896
0 references
0.83464545
0 references
0 references
0 references
0 references
