Recursive circulants and their embeddings among hypercubes
type: Item
instance of: scholarly article
title: Recursive circulants and their embeddings among hypercubes
zbMATH Open document ID: 0945.68003
DOI: 10.1016/S0304-3975(00)00176-6
author: N. Delaunay
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1493477
zbMATH Keywords: circulant graph
zbMATH Keywords: connectivity
zbMATH Keywords: diameter
zbMATH Keywords: embedding
zbMATH Keywords: Hamiltonian property
zbMATH Keywords: interconnection structure
zbMATH Keywords: multicomputer network
zbMATH Keywords: routing algorithm
MaRDI profile type: Publication
cites work: On Group Graphs and Their Fault Tolerance
cites work: Q4003168
cites work: Efficient Embeddings of Trees in Hypercubes
cites work: A general class of invulnerable graphs
cites work: Q3921269
cites work: Generalized de Bruijn digraphs
cites work: The twisted N-cube with application to multiprocessing
cites work: Minimal broadcast networks
cites work: Q4232791
cites work: Optimal Assignments of Numbers to Vertices
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Embedding trees in recursive circulants
cites work: Q3914447
full work available at URL: s0304-3975(00)00176-6
OpenAlex ID: W2054041441
Wikidata QID: Q127683722
description: scientific article; zbMATH DE number 1493477