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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.