In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhedral cones and Ehrhart quasi-polynomials of polytopes. This enables us to generate and enumerate perfect matchings of a graph via magic labelings of the graph. We explore the correspondence of magic labelings of graphs with magic squares and dene polytopes of magic labelings to give a description of the faces of the Birkhoff polytope as polytopes of magic labelings of digraphs
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
AMS Subject Classication: 05E Abstract. In this article, we construct and enumerate the magic labeli...
Magic labelings of graphs are studied in great detail by Stanley and Stewart. In this artic...
Magic labelings of graphs are studied in great detail by Stanley in [18] and [19], and Stewart in [2...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomi...
We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomi...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...
AMS Subject Classication: 05E Abstract. In this article, we construct and enumerate the magic labeli...
Magic labelings of graphs are studied in great detail by Stanley and Stewart. In this artic...
Magic labelings of graphs are studied in great detail by Stanley in [18] and [19], and Stewart in [2...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, an...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
Dedicated to the memory of Claudia Zaslavsky, 19172006 Abstract. A magic labelling of a set system i...
We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomi...
We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomi...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (an...
In this work we have formulated the result of H-magic labeling of some families of graphs which incl...
summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise differ...
We characterize finite graphs that admit a labelling of the edges by pairwise different positive (no...