Maximal line digraphs

DOI10.1002/JGT.70043MaRDI QIDQ7285753zbMATH OpenFDO

Authors Quentin Japhet, Dimitri Watel, D. Barth, Marc-Antoine Weisser

Publication date 22 June 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.70043

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Graph operations (line graphs, products, etc.) (05C76)

Review text

The paper studies maximal line digraphs and determines the maximum possible number of arcs in a line digraph of a given order. The authors establish sharp upper bounds for both even and odd orders and completely characterize the extremal line digraphs attaining these bounds. The proofs are rigorous and rely on a careful structural analysis of line digraphs and their root digraphs. The results are original, mathematically sound, and represent a valuable contribution to extremal graph theory.

Cites work

• A Note on the Order of Iterated Line Digraphs
• Edge-maximal graphs of branchwidth k: The k-branches
• Graphs with maximal number of adjacent pairs of edges
• scientific article; zbMATH DE number 3218572 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• Maximal edge colorings of graphs
• The maximal spectral radius of a digraph with (m+1)^2-s edges
• The number of edges in maximal 2-planar graphs

This page was built for publication: Maximal line digraphs

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