A Note on the Order of Iterated Line Digraphs

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 Lk(G), for k≥0, where L0(G)=G. We obtain this result by using the minimal polynomial of a quotient digraph π(G) of G.

Saved in:

Bibliographic Details
Published in:	Journal of graph theory Vol. 85; no. 2; pp. 395 - 399
Main Authors:	Dalfó, C., Fiol, M. A.
Format:	Journal Article Publication
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 01.06.2017 Wiley
Subjects:	05 Combinatorics 05C Graph theory 05C20 05C50 adjacency matrix Classificació AMS Graph theory Line digraph Matemàtica discreta Matemàtiques i estadística minimal polynomial quotient digraph recurrence regular partition Teoria de grafs Àrees temàtiques de la UPC
ISSN:	0364-9024, 1097-0118
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!