Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Ilhan Hacioglu"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 3, Pp 148-153 (2021)
In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained. In this article, first we compute the upper and lower bounds for the energ
Externí odkaz:
https://doaj.org/article/0dc90c97fa1c4d6cbb8eacd33ee7fdf2
Autor:
Alper Bulut, Ilhan Hacioglu
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 25-28 (2021)
In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and
Externí odkaz:
https://doaj.org/article/cb4f43e184ae40faa6bc6ef3bbaf64ed
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2013 (2013)
By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cycles and paths, we prove that they are nonderogatory.
Externí odkaz:
https://doaj.org/article/883d79c6f6cf44d78554e18bc0b25e20
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 3, Pp 148-153 (2021)
In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained. In this article, first we compute the upper and lower bounds for the energ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7ff87ddeeaca132de22eca618f2e9a6
https://doaj.org/article/0dc90c97fa1c4d6cbb8eacd33ee7fdf2
https://doaj.org/article/0dc90c97fa1c4d6cbb8eacd33ee7fdf2
Publikováno v:
Graphs and Combinatorics. 36:139-151
In this paper we provide a construction method which generates all tournament matrices with a prescribed score-list with minimum number of upsets. We set up a correspondence between a tournament matrix with minimum number of upsets and perfect matchi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30a8e94a13e12db139873f81def9de40
https://doi.org/10.1007/s00373-019-02124-0
https://doi.org/10.1007/s00373-019-02124-0
Autor:
Alper Bulut, Ilhan Hacioglu
Publikováno v:
Linear and Multilinear Algebra. 68:679-685
We identify the intervals where the eigenvalues of all connected cubic circulant graphs are positive or negative. Then by using the symmetry we determine the closed formula that has to be computed....
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f6fff1280cb7d28fe0e9c4a9b99501c
https://doi.org/10.1080/03081087.2018.1516186
https://doi.org/10.1080/03081087.2018.1516186
Autor:
Ilhan Hacioglu, Burak Kurkcu
Publikováno v:
Discrete Applied Mathematics. 171:147-152
In this article, we define the binary codes of tournament matrices in the class T ( R ) and give unique construction algorithms for matrices which have minimum and maximum binary codes. By introducing a generating algorithm with an order we show that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25341dad06b9a8e396fa6cc65f6e24df
https://doi.org/10.1016/j.dam.2014.02.019
https://doi.org/10.1016/j.dam.2014.02.019
Autor:
Ilhan Hacioglu
Publikováno v:
Algebra Colloquium. 18:259-272
Suppose that (P,B,F) is a triple consisting of the points, blocks and flags of a generalized m-gon, and H(F) the associated rank-2 Iwahori–Hecke algebra. H(F) acts naturally on the integral standard module ZF based on F. This work gives arithmetic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff152dde494cea22af9d1ac373284e0f
https://doi.org/10.1142/s1005386711000162
https://doi.org/10.1142/s1005386711000162
Publikováno v:
The Electronic Journal of Linear Algebra. 28
Fletcher asked whether there is a (0, 1)-matrix of order greater than 3 whose square is a regular tournament matrix. We give a negative answer for a special class of regular tournament matrices: There is no (0, 1)-matrix of order greater than 3 whose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d2f1c84f5f4070c5eb3d0d48c709396
https://doi.org/10.13001/1081-3810.3008
https://doi.org/10.13001/1081-3810.3008
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2013 (2013)
By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cycles and paths, we prove that they are nonderogatory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b0ffd15d73fc82c15e0eb554f083e06
https://doaj.org/article/883d79c6f6cf44d78554e18bc0b25e20
https://doaj.org/article/883d79c6f6cf44d78554e18bc0b25e20