Pancyclicity of recursive circulant graphs

From MaRDI portal
Publication:1603500

DOI10.1016/S0020-0190(01)00226-5zbMath1013.68137OpenAlexW2030598386MaRDI QIDQ1603500

Toru Araki, Yukio Shibata

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00226-5




Related Items (23)

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphsCycle embedding in star graphs with conditional edge faultsPanconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elementsGeodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercubeDisjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elementsThe bipanconnectivity and \(m\)-panconnectivity of the folded hypercubeThe \(m\)-pancycle-connectivity of a WK-recursive networkOn vertex-pancyclicity and edge-pancyclicity of the WK-recursive networkPanconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)On Hamiltonian paths in distance graphsOn embedding cycles into faulty twisted cubesLong cycles and paths in distance graphsCONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)Panconnectivity and edge-pancyclicity ofk-aryn-cubesCycle embedding of augmented cubesPath embedding in star graphsThe bipancycle-connectivity of the hypercubeOn the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)Edge-pancyclicity of recursive circulantsMaximum induced subgraph of a recursive circulantSurvey on path and cycle embedding in some networksHamiltonian properties on a class of circulant interconnection networksPancyclicity and Cayley Graphs on Abelian Groups



Cites Work


This page was built for publication: Pancyclicity of recursive circulant graphs