Related papers: Matching groups and gliding systems
Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect…
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
Matched pairs of Lie groupoids and Lie algebroids are studied. Discrete Euler-Lagrange equations are written for the matched pairs of Lie groupoids. As such, a geometric framework to analyse a discrete system by decomposing it into two…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a…
We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on…
A travel groupoid is an algebraic system satisfying two suitable conditions, which has a relation to graphs. In this article, we characterize travel groupoids on finite complete multipartite graphs, and we give the numbers of travel…
Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are…