Toughness of directed graphs

We initiate a study of the toughness of directed graphs by considering the natural generalization of that for ordinary graphs. After providing some general results, computations are completed for a few natural examples. Maximum possible toughness is also considered. Some open problems are posed.

Authors

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-03-27
DOI
https://doi.org/10.61091/jcmcc125-19
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Toughness of directed graphs

Kevin K. Ferland
Journal of Combinatorial Mathematics and Combinatorial Computing
Graph Labeling and Dimension Problems
article

Toughness of directed graphs

Kevin K. Ferland
article en

Abstract

We initiate a study of the toughness of directed graphs by considering the natural generalization of that for ordinary graphs. After providing some general results, computations are completed for a few natural examples. Maximum possible toughness is also considered. Some open problems are posed.

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 125
Openalex Percentile: Top 93%
Graph Labeling and Dimension Problems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Toughness of directed graphs — Kevin K. Ferland · Journal of Combinatorial Mathematics and Combinatorial Computing (2025) | TGRS Research Map | TGRS