. "P(1P05ME749), P(IAA100190803), Z(AV0Z10190503)" . "V \u010Dl\u00E1nku zobec\u0148ujeme n\u011Bkter\u00E1 zn\u00E1m\u00E1 tvrzen\u00ED pro kvadratick\u00E9 kongruence, kter\u00E9 odpov\u00EDdaj\u00ED symetrick\u00FDm orientovan\u00FDm graf\u016Fm, na p\u0159\u00EDpad k > 2."@cs . "11"^^ . . . "RIV/67985840:_____/09:00323492" . "O symetrick\u00FDch orientovan\u00FDch grafech kongruence xk = y (mod n)"@cs . . "RIV/67985840:_____/09:00323492!RIV09-AV0-67985840" . . "10" . "We assign to each pair of positive integers n and k > 2 a digraph G (n,k) whose set of vertices is H = (0,1, ...,n-1) and for which there is a directed edge from a .. H to b .. H if ak= b (mod n). The digraph G(n,k) is symmetric of order M if its set of components can be partitioned into subsets of size M with each subset containing M isomorphic components. We generalize earlier theorems by Szalay, Carlip, and Mincheva on symmetric digraphs G(n,2) of order 2 to symmetric digraphs G(n,k) of order M when k > 2 is arbitrary"@en . "We assign to each pair of positive integers n and k > 2 a digraph G (n,k) whose set of vertices is H = (0,1, ...,n-1) and for which there is a directed edge from a .. H to b .. H if ak= b (mod n). The digraph G(n,k) is symmetric of order M if its set of components can be partitioned into subsets of size M with each subset containing M isomorphic components. We generalize earlier theorems by Szalay, Carlip, and Mincheva on symmetric digraphs G(n,2) of order 2 to symmetric digraphs G(n,k) of order M when k > 2 is arbitrary" . . . . . "On symmetric digraphs of the congruence xk = y(mod n)"@en . "0012-365X" . . . "000265176000008" . "1"^^ . "O symetrick\u00FDch orientovan\u00FDch grafech kongruence xk = y (mod n)"@cs . "[DEB9A974F0AB]" . "2"^^ . "Somer, L." . . . "K\u0159\u00ED\u017Eek, Michal" . . "chinese remainder theorem; congruence; symmetric digraphs"@en . "309" . "Discrete Mathematics" . "NL - Nizozemsko" . . . . "On symmetric digraphs of the congruence xk = y(mod n)"@en . "On symmetric digraphs of the congruence xk = y(mod n)" . . "331468" . "On symmetric digraphs of the congruence xk = y(mod n)" .