Disjoint Hamilton cycles in the star graph

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00501799" target="_blank" >RIV/49777513:23520/09:00501799 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Disjoint Hamilton cycles in the star graph

Original language description

In 1987, Akers, Harel and Krishnamurthy proposed the star graph Sigma(n) as a new topology for interconnection networks. Hamiltonian properties of these graphs have been investigated by several authors. In this paper, we prove that Sigma(n) contains lfloor n/8 rfloor pairwise edge-disjoint Hamilton cycles when n is prime, and Omega(n/log log n) such cycles for arbitrary n.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/ME%20885" target="_blank" >ME 885: Graph structures, graph operators and related computional complexity</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Information Processing Letters

ISSN

0020-0190

e-ISSN

—

Volume of the periodical

110

Issue of the periodical within the volume

1

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

6

Pages from-to

—

UT code for WoS article

000272583400007

EID of the result in the Scopus database

—