23 research outputs found
Some Investigations in the Theory of Graphs
Not availabl
Some Topics of Special Interest in Graph Theory
Not availabl
(2,3)-Cordial Oriented Hypercubes
L. B. Beasley recently defined a digraph labeling called (2,3)-cordial.
Digraphs for which a (2,3)-cordial labeling can be applied are called
(2,3)-cordial digraphs. Herein, we consider the existence and identification of
(2,3)-cordial oriented hypercubes. We demonstrate that for every nonzero
dimension, there exists a (2,3)-cordial oriented hypercube. Additionally, we
demonstrate that not all oriented hypercubes of nonzero dimension are
(2,3)-cordial. Finally, we present preliminary results regarding the
identification of (2,3)-cordial oriented hypercubes, particularly for dimension
3.Comment: 14 pages, 6 figure