Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The diameter of the cube-connected cycles

From MaRDI portal
Publication:290207
Jump to:navigation, search

DOI10.1016/S0020-0190(97)00013-6zbMath1337.68204OpenAlexW2044927976MaRDI QIDQ290207

Petr Liebl, Ivan Friš, Ivan M. Havel

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00013-6


zbMATH Keywords

hypercubecombinatorial problemsinterconnection networksHamiltonian pathgraph diametercube-connected cycles


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)


Related Items (6)

Data center interconnection networks are not hyperbolic ⋮ The family of generalized variational network of cube-connected cycles ⋮ Cycles in cube-connected cycles graphs ⋮ RVCCC: a new variational network of cube-connected cycles and its topological properties ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Matching preclusion for cube-connected cycles



Cites Work

  • On Hamiltonian Walks in Graphs
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: The diameter of the cube-connected cycles

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:290207&oldid=12172207"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki