On the tenacity of cycle permutation graph

07/01/2020
by   Peyman Nasehpour, Ph.D., et al.
0

A special class of cubic graphs is the cycle permutation graphs. A cycle permutation graph $P_n(\alpha)$ is defined by taking two vertex-disjoint cycles on $n$ vertices and adding a matching between the vertices of the two cycles. In this paper, we determine a good upper bound for the tenacity of cycle permutation graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2023

Cycles in graphs and in hypergraphs

This is an expository paper. A 1-cycle in a graph is a set C of edges su...
research
10/09/2018

Cycle Intersection Graphs and Minimum Decycling Sets of Even Graphs

We introduce the cycle intersection graph of a graph, an adaptation of t...
research
07/01/2023

Graphs with Permutation-Representation Number at most Three

In this paper, firstly, we reconcile the graphs with permutation-represe...
research
10/11/2022

Kernelized multi-graph matching

Multigraph matching is a recent variant of the graph matching problem. I...
research
06/20/2023

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs

In this paper, we provide bounds for the genus of the pancake graph ℙ_n,...
research
03/16/2018

Synchronisation of Partial Multi-Matchings via Non-negative Factorisations

In this work we study permutation synchronisation for the challenging ca...
research
11/05/2017

Sparse Kneser graphs are Hamiltonian

For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...

Please sign up or login with your details

Forgot password? Click here to reset