Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Xor-Magic Graphs
View through CrossRef
Abstract
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-regular xor-magic graphs on 8 and 16 vertices, and give multiple examples of 3-regular xor-magic graphs on 32 vertices, including the well-known Dyck graph.
Title: Xor-Magic Graphs
Description:
Abstract
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-regular xor-magic graphs on 8 and 16 vertices, and give multiple examples of 3-regular xor-magic graphs on 32 vertices, including the well-known Dyck graph.
Related Results
Nigella sativa L. oil: Study of its toxicity, antiradical activity, and effect on circulating xanthine oxidoreductase
Nigella sativa L. oil: Study of its toxicity, antiradical activity, and effect on circulating xanthine oxidoreductase
Introduction: Nigella sativa L. is a widely used medicinal plant throughout the world. The low toxic effects and low price of this plant make it an excellent treatment choice for m...
SIHIR DALAM AL-QUR’AN: KAJIAN TAFSIR TEMATIK
SIHIR DALAM AL-QUR’AN: KAJIAN TAFSIR TEMATIK
This research examines magic in holy Qur’an, which the magic is a maksiat and a great sin, because magic is an odd thing that seems to be an an extraordinary thing but not extraord...
Expected performance of future MAGIC data-assimilated Terrestrial Water Storage (TWS) products
Expected performance of future MAGIC data-assimilated Terrestrial Water Storage (TWS) products
The planned MAGIC mission, a collaboration between ESA and NASA, is expected to deliver an extended record of the global mass transport time series with improved accuracy,...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Design of XOR and XNOR Based Full Adder Circuits
Design of XOR and XNOR Based Full Adder Circuits
This paper has a XOR / XNOR gate circuits produces separate and establishes a simultaneous XOR - XNOR function.. Due to stubby yield capacity and short-circuit energy dissipation, ...
Enhancement of Rabin-Karp Algorithmusing XOR Filter
Enhancement of Rabin-Karp Algorithmusing XOR Filter
Purpose–Thestudy aims to enhance the Rabin-Karp Algorithm that underlinesthe problem encountered wherein the algorithm’s runtimeperformanceis affected due tothe continuous rap...
Determination of the Optimal Window Size for the Spatial XOR Filter
Determination of the Optimal Window Size for the Spatial XOR Filter
ABSTRACTIntroductionAn XOR filter is a probabilistic data structure representing a set of keys for membership queries. Given a set of keys, and hash functions , the filter relies...
Himpunan Kritis pada Graf Bintang
Himpunan Kritis pada Graf Bintang
Labeling is a one-to-one mapping that maps each element of a graph to Positive numbers called labels. One of its kind is edge-magic total labeling. Under special conditions, the re...