The underlying graph of a line digraph (Q1199455): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Jorge Luis Villar / rank | |||
Property / reviewed by | |||
Property / reviewed by: John W. Moon / rank | |||
Revision as of 09:31, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The underlying graph of a line digraph |
scientific article |
Statements
The underlying graph of a line digraph (English)
0 references
16 January 1993
0 references
A restricted line digraph is the line digraph of a digraph without parallel arcs (and hence with at most one loop at any vertex) and in which each vertex has in-degree and out-degree at least two. The author shows that, apart from a few cases, any connected graph can be oriented as a restricted line digraph in at most two ways. He also characterizes the underlying graphs of restricted line digraphs and deduces from this a relation between the automorphism groups of a restricted line digraph and its underlying graph.
0 references
underlying graph
0 references
line digraph
0 references
automorphism groups
0 references