The underlying graph of a line digraph (Q1199455): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: On the linegraph of a directed-graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Large fault-tolerant interconnection networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5834367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximally connected digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Line Digraph Iterations and the (d, k) Digraph Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some properties of line digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3872508 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fault-tolerant routings in Kautz and de Bruijn networks / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90156-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091851332 / rank | |||
Normal rank |
Latest revision as of 11:08, 30 July 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