{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:20Z","timestamp":1753893860386,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $p$ be a prime, $e$ a positive integer, $q = p^e$, and let\u00a0$\\mathbb{F}_q$ denote the finite field of $q$ elements.\u00a0Let $f_i\\colon\\mathbb{F}_q^2\\to\\mathbb{F}_q$ be arbitrary functions, where $1\\le i\\le l$, $i$ and $l$\u00a0are integers. The digraph $D = D(q;\\bf{f})$, where\u00a0${\\bf f}=f_1,\\dotso,f_l)\\colon\\mathbb{F}_q^2\\to\\mathbb{F}_q^l$, is defined as follows.\u00a0The vertex set of $D$\u00a0is $\\mathbb{F}_q^{l+1}$. There is an arc from a vertex ${\\bf x} = (x_1,\\dotso,x_{l+1})$ to a vertex\u00a0${\\bf y} = (y_1,\\dotso,y_{l+1})$ if\u00a0$x_i + y_i = f_{i-1}(x_1,y_1)$\u00a0for all $i$, $2\\le i \\le l+1$.\u00a0In this paper we study the strong connectivity of $D$ and completely describe its strong components. The digraphs $D$\u00a0are directed analogues of some algebraically defined graphs, which have been studied extensively\u00a0and have many applications.<\/jats:p>","DOI":"10.37236\/5052","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:26:22Z","timestamp":1578651982000},"source":"Crossref","is-referenced-by-count":3,"title":["Connectivity of some Algebraically Defined Digraphs"],"prefix":"10.37236","volume":"22","author":[{"given":"Aleksandr","family":"Kodess","sequence":"first","affiliation":[]},{"given":"Felix","family":"Lazebnik","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2015,8,28]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i3p27\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i3p27\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T05:13:15Z","timestamp":1579237995000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i3p27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,28]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2015,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/5052","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2015,8,28]]},"article-number":"P3.27"}}