Name
Abstract | ||
|---|---|---|
The primary result of this paper gives a set of necessary and sufficient conditions for a digraph to be second-order line digraph of some digraph. A directed analogue of the concept of an intersection graph, defined for collections of ordered pairs of sets and called the connection digraph, is used to achieve this result. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1016/0012-365X(82)90147-9 | Discrete Mathematics |
Keywords | Field | DocType |
second order | Discrete mathematics,Combinatorics,Ordered pair,Intersection graph,Cycle rank,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
39 | 3 | Discrete Mathematics |
Citations | PageRank | References |
9 | 1.28 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lowell W. Beineke | 1 | 204 | 86.82 |
| Christina M Zamfirescu | 2 | 30 | 4.80 |