Edge-magic trees (Q1860738): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans L. Bodlaender / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans L. Bodlaender / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 05:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-magic trees |
scientific article |
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
