2008
DOI: 10.1007/s00026-008-0349-y
|View full text |Cite
|
Sign up to set email alerts
|

Polytopes of Magic Labelings of Graphs and the Faces of the Birkhoff Polytope

Abstract: 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 define polytopes of magic labelings to give a description of the faces of the Birkhoff polytope as polytopes of magic labelings of digraphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
2
2
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 34 publications
0
9
0
Order By: Relevance
“…Carathéodory's theorem ensures that every n×n doubly stochastic matrix can be written as a convex combination of at most n 2 − 2n + 2 permutation matrices. Geometrical and combinatorial properties of the Birkhoff polytope have been extensively studied; see, e.g., [2,6,7,8,10,11,20,17]; see also [18, pp. 47-52] for a brief account.…”
Section: ])mentioning
confidence: 99%
See 1 more Smart Citation
“…Carathéodory's theorem ensures that every n×n doubly stochastic matrix can be written as a convex combination of at most n 2 − 2n + 2 permutation matrices. Geometrical and combinatorial properties of the Birkhoff polytope have been extensively studied; see, e.g., [2,6,7,8,10,11,20,17]; see also [18, pp. 47-52] for a brief account.…”
Section: ])mentioning
confidence: 99%
“…In enumerating vertices of the polytope L n , different approaches have been undertaken: (1). Combinatorial method via Latin squares (see, e.g., [3, Theorem 0.1] or [1, Theorem 2.0.10]); (2). Analytic approach by using hyperplane and induction [9]; (3).…”
Section: ])mentioning
confidence: 99%
“…. , 1 (n) } of the all-ones vector 1 in R h−1 , together with n copies {−e (1) Now consider the chamber in the Gale dual whose extreme rays are {−e 1 , −e 2 , . .…”
Section: Frobenius Groupsmentioning
confidence: 99%
“…Proposition 4.3. The Gale dual of P (G) is the vector configuration consisting of n copies {1 (1) , 1 (2) , . .…”
Section: Frobenius Groupsmentioning
confidence: 99%
See 1 more Smart Citation