Related papers: Dualities and reciprocities on graphs on surfaces

We use group theory to construct infinite families of maps on surfaces which are invariant under Wilson's map operations of order 3 but not under the operations of order 2, such as duality and Petrie duality.

By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.

We show that the points of a global function field, whose classes are 2-divisible in the Picard group, form a connected graph, with the incidence relation generalizing the well known quadratic reciprocity law. We prove that for every global…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…

Duality methods are used to generate explicit solutions to nonlinear Hodge systems, demonstrate the well-posedness of boundary value problems, and reveal, via the Hodge-B\"acklund transformation, underlying symmetries among superficially…

Dual equivalence graphs are a powerful tool in symmetric function theory that provide a general framework for proving that a given quasisymmetric function is symmetric and Schur positive. In this paper, we study a larger family of graphs…

In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

Duality relations are obtained for correlation functions of the q-state Potts model on any planar lattice or graph using a simple graphical analysis. For the two-point correlation we show that the correlation length is precisely the surface…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by…

Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

We introduce one-way flows in near algebras and two-way flows in double near algebras with two interrelated multiplications. We establish parametric representations of the one-way and two-way flows in terms of a single element of the…

We study the geometry of equiclassical strata of the discriminant in the space of plane curves of a given degree, which are families of curves of given degree, genus and class (degree of the dual curve). Our main observation is that the use…

All types of networks arise as intricate combinations of dyadic building blocks formed by pairs of vertices. In directed networks, the dyadic patterns are entirely determined by reciprocity, i.e. the tendency to form, or to avoid, mutual…