Xor-Magic Graphs
Xor-Magic Graphs
About this item
Full title
Xor-Magic Graphs
Author / Creator
Publisher
Lisbon: De Gruyter Poland
Journal title
Recreational Mathematics Magazine, 2019-09, Vol.6 (11), p.35-44
Language
English
Formats
Publication information
Publisher
Lisbon: De Gruyter Poland
More information
Scope and Contents
Contents
A connected graph on 2n vertices is defined to be xor-magic if the vertices can be labeled with distinct n-bit binary numbers in such a way that the label at each vertex is equal to the bitwise xor of the labels on the adjacent vertices. We show that there is at least one 3-regular xor-magic graph on 2n vertices for every n ⩾ 2. We classify the 3-r...
Alternative Titles
Full title
Xor-Magic Graphs
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_3158177658
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_3158177658
Other Identifiers
ISSN
2182-1968
E-ISSN
2182-1976
DOI
10.2478/rmm-2019-0004
How to access this item
Log in as a Library member
