Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Zülfükar Saygı"'
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
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
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:
Zülfükar Saygı
Lucas cubes are the special subgraphs of Fibonacci cubes. For small dimensions, their domination numbers are obtained by direct search or integer linear programming. For larger dimensions some bounds on these numbers are given. In this work, we prese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0fd190d575b262c2c9c5f8e3f38b217b
http://hdl.handle.net/20.500.11851/3984
http://hdl.handle.net/20.500.11851/3984
Publikováno v:
Volume: 43, Issue: 2 795-812
Turkish Journal of Mathematics
Turkish Journal of Mathematics
In this article we give an explicit formula for the number of $k$-normal elements, hence answering Problem 6.1. of Huczynska et al. (Existence and properties of $k$-normal elements over finite fields, Finite Fields Appl 2013; 24: 170-183). Furthermor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86e9d2557af42537f0fe7294f014c652
https://dergipark.org.tr/tr/pub/tbtkmath/issue/45654/575303
https://dergipark.org.tr/tr/pub/tbtkmath/issue/45654/575303
Publikováno v:
Designs, Codes and Cryptography. 79:423-441
Let q be a positive power of a prime number. For arbitrary positive integers h, n, m with n dividing m and arbitrary $$\gamma ,\alpha \in {\mathbb {F}}_{q^m}$$?,??Fqm with $$\gamma \ne 0$$??0 the number of $${\mathbb {F}}_{q^m}$$Fqm-rational points o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e48994808b0e28b57c7e712b6112c74
https://doi.org/10.1007/s10623-015-0107-1
https://doi.org/10.1007/s10623-015-0107-1
Publikováno v:
Designs, Codes and Cryptography. 59:287-318
We study a class of authentication codes with secrecy. We determine the maximum success probabilities of the impersonation and the substitution attacks on these codes and the level of secrecy. Therefore we give an answer to an open problem stated in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9ba6c6b70214238929f02b5e0c501a0
https://doi.org/10.1007/s10623-010-9461-1
https://doi.org/10.1007/s10623-010-9461-1
Autor:
Ferruh Özbudak, Zülfükar Saygı
Publikováno v:
Applied Algebra and Number Theory
Let q be a power of an odd prime. For arbitrary positive integers h, n, m with n dividing m and arbitrary with ? ? 0 we determine the number of -rational points of the curve in many cases.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51469b9b22ae57f1bfdc09e052e2189e
http://hdl.handle.net/20.500.11851/3743
http://hdl.handle.net/20.500.11851/3743
Autor:
Zülfükar Saygı
Publikováno v:
Designs, Codes & Cryptography; Dec2008, Vol. 49 Issue 1-3, p61-77, 17p