2011
DOI: 10.1016/j.amc.2011.03.065
|View full text |Cite
|
Sign up to set email alerts
|

On suborbital graphs and related continued fractions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 4 publications
0
14
0
Order By: Relevance
“…The G u,N and F u,N suborbital graphs are consisted at these works. In [3] and [8], the results are extended. The definition of minimal length path for F u,N suborbital graphs is given by Deger in [4].…”
Section: Introductionmentioning
confidence: 97%
“…The G u,N and F u,N suborbital graphs are consisted at these works. In [3] and [8], the results are extended. The definition of minimal length path for F u,N suborbital graphs is given by Deger in [4].…”
Section: Introductionmentioning
confidence: 97%
“… 1991 ); A shortest path in trees of suborbital graphs is a special case of Pringsheim continued fraction (Deger et al. 2011 ); The subgraph can be defined as a new kind of continued fraction and any irrational numbers has a unique expansion (Sarma et al. 2015 ); The set of vertices of some suborbital graphs is strongly connected to the Fibonacci sequence (Akbaş et al.…”
Section: Introductionmentioning
confidence: 99%
“…A shortest path in trees of suborbital graphs is a special case of Pringsheim continued fraction (Deger et al. 2011 );…”
Section: Introductionmentioning
confidence: 99%
“…Elliptic elements do not necessarily correspond to circuits of the same order. On the other hand, it is worth noting that these graphs give some number theoretical results about continued fractions and Fibonacci numbers as in [4,8,17].…”
Section: Introductionmentioning
confidence: 99%
“…Then similar studies were done for related finitely generated groups.The reader is referred to [2][3][4][5]8,9,[11][12][13][14][15][16] for some relevant previous work on suborbital graphs. Firstly, in [3], it was proved that the elliptic elements in Γ 0 (n) correspond to circuits in the subgraph F u,n of the same order and vice versa.…”
Section: Introductionmentioning
confidence: 99%