A Sokoban-type game and arc deletion within irregular digraphs of all sizes | Zendy

Zyta Dziechcińska-Halamoda | Zendy; Zofia Majcher | Zendy; Jerzy Michael | Zendy; Zdzisław Skupień | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Sokoban-type game and arc deletion within irregular digraphs of all sizes

Author(s) -

Zyta Dziechcińska-Halamoda,

Zofia Majcher,

Jerzy Michael,

Zdzisław Skupień

Publication year - 2007

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.1387

Subject(s) - mathematics , combinatorics , arc (geometry) , type (biology) , discrete mathematics , geometry , biology , ecology

Digraphs in which ordered pairs of outand in-degrees of vertices are mutually distinct are called irregular, see Gargano et al. [3]. 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 612 Z. Dziechcińska-Halamoda, Z. Majcher, ... 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research