This book was motivated by the notion that some of the underlying difficulty in challenging instances of graphbased problems (e.g., the Traveling Salesman Problem) may be "inherited" from simpler graphs which  in an appropriate sense  could be seen as "ancestors" of the given graph instance. The authors propose a partitioning of the set of unlabeled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants dominates that of the genes. The key distinction between the two subsets is the presence of special edge cut sets, called cubic crackers, in the descendants. The book begins by proving that any given descendant may be constructed by starting from a finite set of genes and introducing the required cubic crackers through the use of six special operations, called breeding operations. It shows that each breeding operation is invertible, and these inverse operations are examined. It is therefore possible, for any given descendant, to identify a family of genes that could be used to generate the descendant. The authors refer to such a family of genes as a "complete family of ancestor genes" for that particular descendant. The book proves the fundamental, although quite unexpected, result that any given descendant has exactly one complete family of ancestor genes. This result indicates that the particular combination of breeding operations used strikes the right balance between ensuring that every descendant may be constructed while permitting only one generating set. The result that any descendant can be constructed from a unique set of ancestor genes indicates that most of the structure in the descendant has been, in some way, inherited from that, very special, complete family of ancestor genes, with the remaining structure induced by the breeding operations. After establishing this, the authors proceed to investigate a number of graph theoretic properties: Hamiltonicity, bipartiteness, and planarity, and prove results linking properties of the descendant to those of the ancestor genes. They develop necessary (and in some cases, sufficient) conditions for a descendant to contain a property in terms of the properties of its ancestor genes. These results motivate the development of parallelizable heuristics that first decompose a graph into ancestor genes, and then consider the genes individually. In particular, they provide such a heuristic for the Hamiltonian cycle problem. Additionally, a framework for constructing graphs with desired properties is developed, which shows how many (known) graphs that constitute counterexamples of conjectures could be easily found.
About Pouya Baniasadi
Pouya Baniasadi is a doctoral student in mathematics at Flinders University, Australia. He is a recipient of the AF Pillow Applied Mathematics Scholarship from the AF Pillow Mathematics Trust, Australia. Vladimir Ejov is the leader of the Mathematical Analysis research group within Flinders Mathematical Sciences Laboratory, Flinders University, Australia. His research interests are in the areas of several complex variables, geometry of CauchyRiemann manifolds, combinatorial optimisation, Markov decision processes and graph theory. Jerzy A Filar is Director of Flinders Mathematical Sciences Laboratory, Flinders University, Australia, and is a Fellow of the Australian Mathematical Society. His research interests span both theoretical and applied topics in the fields of operations research, optimization, game theory, applied probability, and environmental modelling. Michael Haythorpe is mathematician at Flinders University, Australia. His areas of research interest are numerical optimisation, computational mathematics, algorithm development and graph theory. He is a recipient of the AustMS Liftoff Fellowship Award 2010.Details Book
Author  :  Pouya Baniasadi 
Publisher  :  Springer International Publishing AG 
Data Published  :  24 July 2015 
ISBN  :  3319196790 
EAN  :  9783319196794 
Format Book  :  PDF, Epub, DOCx, TXT 
Number of Pages  :  118 pages 
Age +  :  15 years 
Language  :  English 
Rating  : 
Reviews Genetic Theory for Cubic Graphs

Margo Anderson Get eBook Genetic Theory for Cubic Graphs
Finally I get this ebook, thanks for all these I can get now!

Lisa Doran Best website free download ebook
I was suspicious at first when i got redirected to the membership site. Now I'm really excited i found this online library....many thanks Kisses

Markus Jensen How to download Genetic Theory for Cubic Graphs eBook?
I did not think that this would work, my best friend showed me this website, and it does! I get my most wanted eBook

Roddy Murray
My friends are so mad that they do not know how I have all the high quality ebook which they do not!

Lukasz Czaru
so many fake sites. this is the first one which worked! Many thanks


Andrew Smith
Just select your click then download link, and complete an offer to start downloading the ebook. If there is a survey it only takes 5 minutes, try any survey which works for you.

Kevin Mason
lol it did not even take me 5 minutes at all! XD

