Open AccessRadii and centers in iterated line digraphs
Author(s) -
Martin Knor,
Ľudovít Niepel
Publication year - 1996
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1020
Subject(s) - mathematics , iterated function , combinatorics , line (geometry) , discrete mathematics , geometry , mathematical analysis
We show that the out-radius and the radius grow linearly, or “almost” linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.
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