The structure of digraphs associated with the congruence Xk=y(mod n)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F11%3A00360532" target="_blank" >RIV/67985840:_____/11:00360532 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10587-011-0079-x" target="_blank" >http://dx.doi.org/10.1007/s10587-011-0079-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10587-011-0079-x" target="_blank" >10.1007/s10587-011-0079-x</a>

Result language
angličtina
Original language name
The structure of digraphs associated with the congruence Xk=y(mod n)
Original language description
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 2 H to b 2 H if ak b (mod n). We investigate the structure of G(n, k). In particular,upper bounds are given for the longest cycle in G(n, k). We find subdigraphs of G(n, k), called fundamental constituents of G(n, k), for which all trees attached to cycle vertices are isomorphic.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/IAA100190803" target="_blank" >IAA100190803: The finite element method for higher dimensional problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)