.png){kind=icon}
.png){kind=icon}
Return
Maximal Line Digraphs
.png){kind=icon}
PRE
AI
DOI：10.1002/jgt.70043.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A line digraph is the digraph constructed from the digraph such that there is an arc in if the terminal node of in is the initial node of . The maximum number of arcs in a line digraph with nodes is if is even, and otherwise. For , there is only one line digraph with as many arcs if is even, and if is odd, there are two line digraphs, each being the transpose of the other.
Keywords:
combinatorial
graph theory
line digraph
line graph
Journal
J
IF:
1
Papers:
62
Citations:
0
View more organizations