Related papers: Symmetric Graphs have symmetric Matchings

We determine for which $n$, the complete bipartite graph $K_{n,n}$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph $(m;n)$-regular if every vertex has only degree $m$ or $n$. In…

We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union…

We investigate quantum and nonsignaling generalizations of perfect matchings in graphs using nonlocal games. Specifically, we introduce nonlocal games that test for $L$-perfect matchings in bipartite graphs, perfect matchings in general…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

We consider an involutive automorphism of the conformal algebra and the resulting symmetric space. We display a new action of the conformal group which gives rise to this space. The space has an intrinsic symplectic structure, a…

A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.

We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…

We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…

In a 2018 paper, Cameron and Semeraro posed the problem of finding all group-graph reciprocal pairs. In this paper, we make a significant contribution to finding all such pairs. A group and graph form a reciprocal pair if they satisfy the…

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and…

Given any two graphs on the same vertex set, $G_1 = (V, E_1)$ and $G_2 = (V, E_2)$, along with the difference between the two graphs $\Delta = (E_1 \setminus E_2) \cup (E_2 \setminus E_1)$, we prove that the ratio of the sizes of the two…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…

We study the symmetry properties of autonomous integrating factors from an algebraic point of view. The symmetries are delineated for the resulting integrals treated as equations and symmetries of the integrals treated as functions or…