Enumeration of Unlabelled Mating Graphs

Autor:	Goran Kilibarda
Rok vydání:	2007
Předmět:	Computer Science::Machine Learning Discrete mathematics Class (set theory) Mathematics::Combinatorics InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL ComputingMethodologies_ARTIFICIALINTELLIGENCE Quantitative Biology::Genomics Bijective proof Theoretical Computer Science Combinatorics Statistics::Machine Learning ComputingMethodologies_PATTERNRECOGNITION TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY behavior and behavior mechanisms Enumeration Bijection Quantitative Biology::Populations and Evolution Discrete Mathematics and Combinatorics natural sciences Mating reproductive and urinary physiology MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Graphs and Combinatorics. 23:183-199
ISSN:	1435-5914 0911-0119
DOI:	10.1007/s00373-007-0692-5
Popis:	The problem of enumeration of unlabelled mating graphs is solved by constructing a bijection between the class of unlabelled mating graphs and the class of unlabelled graphs without endpoints.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f685bec967f32d13161911c749e5c905 https://doi.org/10.1007/s00373-007-0692-5 Zobrazit plný text záznamu Plný text ve formátu PDF