Number of the records: 1
On symmetric digraphs of the congruence x.sup.k./sup. = y(mod n)
- 1.
SYSNO ASEP 0323492 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title On symmetric digraphs of the congruence xk = y(mod n) Title O symetrických orientovaných grafech kongruence xk = y (mod n) Author(s) Somer, L. (US)
Křížek, Michal (MU-W) RID, SAI, ORCIDSource Title Discrete Mathematics. - : Elsevier - ISSN 0012-365X
Roč. 309, č. 10 (2009), s. 1999-2009Number of pages 11 s. Language eng - English Country NL - Netherlands Keywords chinese remainder theorem ; congruence ; symmetric digraphs Subject RIV BA - General Mathematics R&D Projects IAA100190803 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) 1P05ME749 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000265176000008 Annotation 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 Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2009
Number of the records: 1