Two disjoint cycles of various lengths in alternating group graph

DOI10.1016/J.AMC.2022.127407OpenAlexW4286684888MaRDI QIDQ2161900FDOQ2161900

Authors: Dongqin Cheng 

Publication date: 5 August 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127407

Recommendations

• One-to-one disjoint path covers on alternating group graphs
• An optimal result on fault-tolerant cycle-embedding in alternating group graphs
• Fault-tolerant edge and vertex pancyclicity in alternating group graphs
• Edge‐fault‐tolerant pancyclicity of alternating group graphs
• Fault-tolerant cycle-embedding in alternating group graphs

zbMATH Keywords

interconnection networkcycle coververtex disjoint cyclesalternating group graphs

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Graph theory (05Cxx) Computer system organization (68Mxx)

Cites Work

• A kind of conditional fault tolerance of alternating group graphs
• Fault tolerance of edge pancyclicity in alternating group graphs
• Conditional Diagnosability of Alternating Group Graphs
• A new class of interconnection networks based on the alternating group
• Fault-tolerant cycle-embedding in alternating group graphs
• One-to-one disjoint path covers on alternating group graphs
• Fault-tolerant edge and vertex pancyclicity in alternating group graphs
• A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• The automorphism group of the alternating group graph
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model
• The pessimistic diagnosability of alternating group graphs under the PMC model
• The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
• Structure and substructure connectivity of alternating group graphs
• Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
• Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
• A well-equalized 3-CIST partition of alternating group graphs

Cited In (7)

• A disjoint path problem in the alternating group graph
• Two-disjoint-cycle-cover pancyclicity of data center networks
• An algorithm for finding disjoint paths in the alternating group graph
• One-to-one disjoint path covers on alternating group graphs
• Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
• Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
• Two disjoint cycles in digraphs

This page was built for publication: Two disjoint cycles of various lengths in alternating group graph

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