The underlying graph of a line digraph

DOI10.1016/0166-218X(92)90156-5zbMath0760.05052OpenAlexW2091851332MaRDI QIDQ1199455

Jorge Luis Villar

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90156-5

zbMATH Keywords

automorphism groupsline digraphunderlying graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Spanners of underlying graphs of iterated line digraphs ⋮ Containment of butterflies in networks constructed by the line digraph operation ⋮ A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ Uniform homomorphisms of de Bruijn and Kautz networks ⋮ A characterization of partial directed line graphs ⋮ On the complexity of recognizing directed path families ⋮ Miscellaneous Digraph Classes

Cites Work

• Some properties of line digraphs
• Large fault-tolerant interconnection networks
• Fault-tolerant routings in Kautz and de Bruijn networks
• On the linegraph of a directed-graph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Maximally connected digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The underlying graph of a line digraph