Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Ömer Eğecioğlu"'
Autor:
Ömer Eğecioğlu, Bünyamin Şahin
Publikováno v:
Transactions on Combinatorics, Vol 14, Iss 4, Pp 261-270 (2024)
EP numbers were introduced by Estrada and Pogliani in 2008. These are positive integers $E(n)$ defined as the product of $n$ and the sum of the digits of $n$. Estrada and Pogliani suspected that there may be infinitely many twin EP numbers; i.e. thos
Externí odkaz:
https://doaj.org/article/1c556380a46a48599ff4fef97190ebbd
Autor:
Ömer Eğecioğlu, Vesna Iršič
Publikováno v:
Discrete Applied Mathematics. 300:56-71
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many different directio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f775c949020ecd2053648874c10c056
https://doi.org/10.1016/j.dam.2021.05.018
https://doi.org/10.1016/j.dam.2021.05.018
Publikováno v:
International Journal of Foundations of Computer Science. 32:871-899
We introduce alternate Lucas cubes, a new family of graphs designed as an alternative for the well known Lucas cubes. These interconnection networks are subgraphs of Fibonacci cubes and have a useful fundamental decomposition similar to the one for F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be3782e9608261dcc2e3db961dace9dc
https://doi.org/10.1142/s0129054121500271
https://doi.org/10.1142/s0129054121500271
Publikováno v:
Theoretical Computer Science. 871:134-146
The Fibonacci cube is the subgraph of the hypercube induced by the vertices whose binary string representations do not contain two consecutive 1s. These cubes were presented as an alternative interconnection network. In this paper, we calculate the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37bdbe6e3bbc0b78f74ef40fd7cfb962
https://doi.org/10.1016/j.tcs.2021.04.019
https://doi.org/10.1016/j.tcs.2021.04.019
Autor:
Ömer Eğecioğlu, Vesna Iršič
Publikováno v:
Discrete Applied Mathematics. 295:70-84
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s, counte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::022957acf55513cf20e524082827ebe2
https://doi.org/10.1016/j.dam.2021.02.025
https://doi.org/10.1016/j.dam.2021.02.025
Publikováno v:
TURKISH JOURNAL OF MATHEMATICS. 44:1813-1823
Fibonacci cubes are defined as subgraphs of hypercubes, where the vertices are those without two consecutive l's in their binary string representation. k-Fibonacci cubes are in turn special subgraphs of Fibonacci cubes obtained by eliminating certain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e5db5b974ad80e810d71f5bcb458842
https://doi.org/10.3906/mat-2004-20
https://doi.org/10.3906/mat-2004-20
Autor:
Ömer Eğecioğlu, Elif Saygı
Publikováno v:
Discrete Applied Mathematics. 266:191-199
Hypercubes and their special subgraphs, Fibonacci cubes, have been proposed as basic models for interconnection networks. By the recursive nature of Fibonacci cubes, they contain many smaller dimensional hypercubes as subgraphs. In this work, we cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6eec292bd9870cc18e0dd0faaf42324
https://doi.org/10.1016/j.dam.2018.05.015
https://doi.org/10.1016/j.dam.2018.05.015
Irregularity of a graph is an invariant measuring how much the graph differs from a regular graph. Albertson index is one measure of irregularity, defined as the sum of $$|deg(u)-deg(v)|$$ over all edges uv of the graph. Motivated by a recent result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f28af9743df4e82f81c4ebda52d30709
http://hdl.handle.net/20.500.11851/4157
http://hdl.handle.net/20.500.11851/4157
Autor:
Adriano M. Garsia, Ömer Eğecioğlu
Publikováno v:
Graduate Texts in Mathematics ISBN: 9783030712495
We shall start by studying the generating function of the sequence of polynomials $$\displaystyle \sigma _n ( x ) = \sum _{k=1}^n S_{n,k} x^k ~. $$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b0a44cf8d9b14d68ac011e050588f7f
https://doi.org/10.1007/978-3-030-71250-1_6
https://doi.org/10.1007/978-3-030-71250-1_6
Autor:
Adriano M. Garsia, Ömer Eğecioğlu
Publikováno v:
Graduate Texts in Mathematics ISBN: 9783030712495
In this chapter, we shall familiarize ourselves with some of the most basic combinatorial structures and develop skills for constructing them and counting them.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::031615cd34bc43e1392be22a7a7d8aab
https://doi.org/10.1007/978-3-030-71250-1_1
https://doi.org/10.1007/978-3-030-71250-1_1