Totally magic graphs (Q1613532): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Walter D. Wallis / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans L. Bodlaender / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: nauty / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00367-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007032991 / rank | |||
Normal rank | |||
Latest revision as of 10:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Totally magic graphs |
scientific article |
Statements
Totally magic graphs (English)
0 references
29 August 2002
0 references
A one-to-one mapping \(V\cup E \rightarrow \{1, 2, \ldots, |V|+|E|\}\) is vertex magic, if each vertex has the same sum of its label and the labels of its incident edges, and is edge magic if each edge has the same sum of its label and the labels of its endpoints. This paper investigates graphs that have a labelling that is both vertex magic and edge magic, i.e., totally magic. It appears that few graphs have such a labelling. The paper gives a number of necessary conditions, and a number of graphs with a totally magic labelling. Also, with help of computer analysis, the list all such graphs with up to 10 vertices is given.
0 references
graph labelling
0 references
totally magic graphs
0 references
