Dual Hypergraphs
Dual Hypergraphs is a hypergraph constructed by interchanging the roles of vertices and edges of an original hypergraph, where each edge in the original becomes a vertex in the dual and each vertex in the original corresponds to an edge in the dual comprising the vertices associated with the edges incident to it.
29
Publications
1.1K
Citations
68
Authors
40
Institutions
Publications per year
2017–2026
4
Variants
Dual Hypergraph
Parents
29
On the Sandpile Group of Dual Graphs
Robert Cori, Dominique Rossin · European Journal of Combinatorics · 2000 · 169 citations
Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi et al. · SIAM Journal on Discrete Mathematics · 1998 · 135 citations
Sovan Samanta · International Journal of Fuzzy Logic Systems · 2012 · 107 citations
Schensted Algorithms for Dual Graded Graphs
Sergey Fomin · Journal of Algebraic Combinatorics · 1995 · 102 citations · Full text
1–5 of 29
68
4
h-index
2
h-index
2
h-index
Rutgers, The State University of New Jersey, United States
2 publications · 36 citations
2
h-index
2
h-index
1–5 of 68
40
University of Oxford
Oxford, United Kingdom
2 h-index
2 publications
43 citations

Royal Holloway University of London
Egham, United Kingdom
2 h-index
2 publications
53 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
2 h-index
7 publications
240 citations
Max Planck Society
Munich, Germany
2 h-index
2 publications
54 citations
Charles University
Prague, Czechia
2 h-index
2 publications
41 citations
Bielefeld University
Bielefeld, Germany
2 h-index
2 publications
41 citations

Osaka Kyoiku University
Kashihara, Japan
2 h-index
2 publications
50 citations

Tokyo Woman's Christian University
Tokyo, Japan
2 h-index
2 publications
24 citations
1–8 of 40
5 publications · 243 citations
5
h-index
2 publications · 44 citations
2
h-index
2 publications · 41 citations
2
h-index
2 publications · 105 citations
2
h-index
1 publications · 30 citations
1
h-index
1–5