4-Free Strong Digraphs with the Maximum Size

DOI10.1142/S0129626423500044MaRDI QIDQ6135737zbMATH OpenFDO

Authors Qifan Zhang, Liqiong Xu, Yuqing Lin

Publication date 26 August 2023

Published in Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

interconnection networksstrong digraphstrong component4-free digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

Recommendations

• 3-free strong digraphs with the maximum size
• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
• Turán number of 3-free strong digraphs with out-degree restriction
• On the number of cycles possible in digraphs with large girth
• Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs

Cites work

• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Cycles embedding in hypercubes with node failures
• Digraphs
• Edge-bipancyclicity of conditional faulty hypercubes
• Girth in digraphs
• Graph theory
• Minimum feedback arc set of \(m\)-free digraphs
• On Seymour's second neighborhood conjecture of \(m\)-free digraphs
• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
• On embedding cycles into faulty dual-cubes

Cited in

(3)

• 3-free strong digraphs with the maximum size
• Turán number of 3-free strong digraphs with out-degree restriction
• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs

This page was built for publication: 4-Free Strong Digraphs with the Maximum Size

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