Name
Abstract | ||
|---|---|---|
Let D be a digraph of order n. The double vertex digraph S\"2(D) of D is the digraph whose vertex set consists of all ordered pairs of distinct vertices of V(D) such that there is an arc in S\"2(D) from (x,y) to (u,v) if and only if x=u and there is an arc in D from y to v, or y=v and there is an arc in D from x to u. In this paper, we establish some relationships between a digraph and its double vertex digraph. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.05.054 | Discrete Mathematics |
Keywords | Field | DocType |
digraph,exponent,primitive digraph,double vertex digraph | Discrete mathematics,Ordered set,Combinatorics,Arc (geometry),Vertex (geometry),Exponent,Directed graph,Ordered pair,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
309 | 8 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-Bin Gao | 1 | 6 | 7.70 |
| Yanling Shao | 2 | 4 | 4.96 |