Fast recognition of some parametric graph families

08/20/2020
by   Nina Klobas, et al.
0

We identify all [1, λ, 8]-cycle regular I-graphs and all [1, λ, 8]-cycle regular double generalized Petersen graphs. As a consequence we describe linear recognition algorithms for these graph families. Using structural properties of folded cubes we devise a o(N log N) recognition algorithm for them. We also study their [1,λ,4], [1,λ,6] and [2, λ, 6]-cycle regularity and settle the value of parameter λ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2022

Graphs with the same truncated cycle matroid

The classical Whitney's 2-Isomorphism Theorem describes the families of ...
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
08/07/2020

A 2^O(k)n algorithm for k-cycle in minor-closed graph families

Let 𝒞 be a proper minor-closed family of graphs. We present a randomized...
research
12/09/2020

Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1

A P_ℓ-decomposition of a graph G is a set of paths with ℓ edges in G tha...
research
11/29/2021

A fast algorithm on average for solving the Hamilton Cycle problem

We present CertifyHAM, an algorithm which takes as input a graph G and e...
research
08/31/2021

Graphs where Search Methods are Indistinguishable

Graph searching is one of the simplest and most widely used tools in gra...
research
10/18/2020

Even Circuits in Oriented Matroids

In this paper we generalise the even directed cycle problem, which asks ...

Please sign up or login with your details

Forgot password? Click here to reset