The Hamiltonian -median problem.

Glaab, Holger; Pott, Alexander

Displaying similar documents to “The Hamiltonian $p$ -median problem.”

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao, Minyong Shi, Lihua Feng (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn...

Hamiltonian virus-free digraphs.

Ordaz, Oscar, González, Leida, Márquez, Isabel, Quiroz, Domingo (2000)

Divulgaciones Matemáticas

Similarity:

Pairs of disjoint $q$ -element subsets far from each other.

Enomoto, Hikoe, Katona, Gyula O.H. (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Generating hamiltionian cycles in complete graphs.

Fleischner, H., Horák, P., Širáň, J. (1993)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

$k$ -colour partitions of acyclic tournaments.

Barcia, Paulo, Cerdeira, J. Orestes (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On $k$ -path hamiltonian graphs and line-graphs

Tudor Zamfirescu (1971)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

Remarks on Hamiltonian properties of squares of graphs

Günter Schaar (1989)

Archivum Mathematicum

Similarity:

On Hamiltonian consecutive-d digraphs

D. Z. Du, D. F. Hsu (1989)

Banach Center Publications

Similarity:

Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem

Gerard Sierksma (1994)

Applicationes Mathematicae

Similarity:

The 3-Opt procedure deals with interchanging three edges of a tour with three edges not on that tour. For n≥6, the 3-Interchange Graph is a graph on 1/2(n-1)! vertices, corresponding to the hamiltonian tours in K_n; two vertices are adjacent iff the corresponding hamiltonian tours differ in an interchange of 3 edges; i.e. the tours differ in a single 3-Opt step. It is shown that the 3-Interchange Graph is a hamiltonian subgraph of the Symmetric Traveling Salesman Polytope. Upper bounds...

Displaying similar documents to “The Hamiltonian p -median problem.”

Displaying similar documents to “The Hamiltonian $p$ -median problem.”