On the Graph of the Pedigree Polytope release_qag7etyx3jchldpozkpvyv2ewq

by Abdullah Makkeh and Mozhgan Pourmoradnasseri and Dirk Oliver Theis

Released as a article .

2016  

Abstract

Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope graphs as spanning subgraphs. While deciding adjacency of vertices in TSP polytopes is coNP-complete, Arthanari has given a combinatorial (polynomially decidable) characterization of adjacency in Pedigree polytopes. Based on this characterization, we study the graphs of Pedigree polytopes asymptotically, for large numbers of cities. Unlike TSP polytope graphs, which are vertex transitive, Pedigree graphs are not even regular. Using an "adjacency game" to handle Arthanari's intricate inductive characterization of adjacency, we prove that the minimum degree is asymptotically equal to the number of vertices, i.e., the graph is "asymptotically almost complete".
In text/plain format

Archived Files and Locations

application/pdf  466.1 kB
file_67nyp7uqxzginagg4kdcax5hrq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-11-25
Version   v1
Language   en ?
arXiv  1611.08431v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e5710107-318a-490a-b7ea-3b0df431016a
API URL: JSON