Premium
A Note on the Order of Iterated Line Digraphs
Author(s) -
Dalfó C.,
Fiol M. A.
Publication year - 2017
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22068
Subject(s) - digraph , iterated function , mathematics , combinatorics , quotient , order (exchange) , line (geometry) , polynomial , discrete mathematics , mathematical analysis , geometry , finance , economics
Given a digraph G , we propose a new method to find the recurrence equation for the number of vertices n k of the k ‐iterated line digraphL k ( G ) , for k ≥ 0 , whereL 0 ( G ) = G . We obtain this result by using the minimal polynomial of a quotient digraph π ( G ) of G .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom