On the flip graphs on perfect matchings of complete graphs and signed reversal graphs

06/23/2020
by   Sebastian M. Cioabă, et al.
0

In this paper, we study the flip graph on the perfect matchings of a complete graph of even order. We investigate its combinatorial and spectral properties including connections to the signed reversal graph and we improve a previous upper bound on its chromatic number.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/10/2023

Alon-Tarsi Number of Some Complete Multipartite Graphs

The Alon-Tarsi number of a polynomial is a parameter related to the expo...
research
08/10/2018

Construction of cospectral graphs

Construction of non-isomorphic cospectral graphs is a nontrivial problem...
research
07/17/2018

The Simplex Geometry of Graphs

Graphs are a central object of study in various scientific fields, such ...
research
08/14/2018

Multicast Triangular Semilattice Network

We investigate the structure of the code graph of a multicast network th...
research
03/25/2020

Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs

In this paper we study the spectral features, on fractal-like graphs, of...
research
01/04/2021

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph

We investigate special structures due to automorphisms in isogeny graphs...
research
06/09/2022

Connections between graphs and matrix spaces

Given a bipartite graph G, the graphical matrix space 𝒮_G consists of ma...

Please sign up or login with your details

Forgot password? Click here to reset