Showing math.COShow all
3 papers · 1 filter
math.CO2012
Genetic Theory for Cubic Graphs
Pouya Baniasadi, Vladimir Ejov, Jerzy Filar +1
We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much l…
math.CO2006
An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs
V. Ejov, N. Pugacheva, S. Rossomakhine +1
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that sepa…
math.CO2006
Clustering of spectra and fractals of regular graphs
V. Ejov, J. A. Filar, S. K. Lucas +1
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike…