Name
Abstract | ||
|---|---|---|
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices nk of the k-iterated line digraph LkG, for kï¾ź0, where L0G=G. We obtain this result by using the minimal polynomial of a quotient digraph πG of G. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/jgt.22068 | Journal of Graph Theory |
Keywords | Field | DocType |
line digraph,adjacency matrix,minimal polynomial,regular partition,quotient digraph,recurrence | Discrete mathematics,Combinatorics,Square-free integer,Vertex (geometry),Enumeration,Quotient,Minimal polynomial (linear algebra),Ternary operation,Iterated function,Digraph,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 2 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Dalfo | 1 | 1 | 2.06 |
| M. A. Fiol | 2 | 816 | 87.28 |