An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter

DOI10.1007/S00373-002-0488-6zbMATH Open1015.05086OpenAlexW1993995408MaRDI QIDQ1396656

Bolian Liu, Tianming Wang, Xinmin Hou

Publication date: 8 July 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0488-6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396656)