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)

Full work available at URL https://doi.org/10.1142/S0129626423500044

zbMATH Keywords

4-free digraphinterconnection networksstrong componentstrong digraph

Mathematics Subject Classification ID

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

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

• 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
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Minimum feedback arc set of \(m\)-free digraphs
• On embedding cycles into faulty dual-cubes
• On Seymour's second neighborhood conjecture of \(m\)-free digraphs
• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs

Cited in

(3)

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

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)