Toughness of directed graphs

DOI10.61091/JCMCC125-19MaRDI QIDQ6950929zbMATH OpenFDO

Authors Kevin K. Ferland

Publication date 30 July 2025

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC125-19

zbMATH Keywords

connectivitydirected graphtoughness

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Review text

The short article gives an extension of the notion of toughness from graphs to directed graphs. The parameter is then calculated for three classes of directed graphs.

Cites work

• A large class of maximally tough graphs
• A survey of maximum toughness.
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 1885936 (Why is no real title available?)
• scientific article; zbMATH DE number 3394182 (Why is no real title available?)
• On the Toughness of a Graph
• Tough graphs and Hamiltonian circuits.

This page was built for publication: Toughness of directed graphs

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