Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian

DOI10.1007/s00373-023-02620-4OpenAlexW4321087831MaRDI QIDQ2701392

Ji Xiang Meng, Li-Li Yuan

Publication date: 28 April 2023

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

Full work available at URL: https://doi.org/10.1007/s00373-023-02620-4

zbMATH Keywords

circulant digraphantistronganti-Eulerianbi-circulant graphweakly-antistrong

Mathematics Subject Classification ID

Graph theory (05Cxx) Designs and configurations (05Bxx) Combinatorics (05-XX)

Related Items (1)

Ore conditions for antistrong digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Antistrong digraphs
• Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
• On isomorphisms of circulant digraphs of bounded degree
• Isomorphisms of circulant digraphs
• The antistrong property for special digraph families
• Anti-Eulerian digraphs
• Rainbow antistrong connection in tournaments
• Connectivity of circulant digraphs
• Digraphs
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian