ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 27(3) (2007)
Institute of Mathematics and Informatics
University of Opole
Oleska 48, 45-052 Opole, Poland
Faculty of Applied Mathematics
AGH University of Science and Technology
al. Mickiewicza 30, 30-059 Kraków, Poland
Our investigations focus on the problem: what are possible sizes of irregular
digraphs (oriented graphs) for a given order n? We show that those sizes
in both cases make up integer intervals. The extremal sizes (the endpoints
of these intervals) are found in [1,5]. In this paper we construct,
with help of Sokoban-type game, n-vertex irregular oriented graphs
(irregular digraphs) of all intermediate sizes.
Keywords: irregular digraph, all sizes.
2000 Mathematics Subject Classification: 05C20.
Received 1 March 2006
Revised 7 December 2006
Accepted 10 January 2007