Uğur Odabaşı

Dr. Uğur Odabaşı

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2025 in Discussiones Mathematicae Graph Theory
Verified
Journal Article
Closed access
FYFatih Yetgin
Fatih Yetgin
UOUğur Odabaşı
Uğur Odabaşı
SÖSibel Özkan
Sibel Özkan

30 April 2025 in Contributions to Discrete Mathematics
Verified
Journal Article
Open access
PDF file
FYFatih Yetgin
Fatih Yetgin
UOUğur Odabaşı
Uğur Odabaşı
SÖSibel Özkan
Sibel Özkan
The Directed Hamilton-Waterloo Problem asks for a directed $2$-factorization of the complete symmetric digraph $K_v^*$ where there are two non-isomorphic $2$-factors. In the uniform version of the problem, factors consist of either directed $m$-cycles or $n$-cycles. In this paper, necessary conditions for a solution to this problem are given, and the problem is completely solved for the factors with $(m, n)\in \{(4,6),(4,8),(4,12),(4,16),(6,12),(8,16)\}$. Furthermore, the problem is solved for $(m, n)\in \{(3,5),(3,15),(5,15)\}$ when $v$ is odd with a few possible exceptions.

27 July 2021 in TURKISH JOURNAL OF MATHEMATICS
Verified
Journal Article
Closed access
UOUğur Odabaşı
Uğur Odabaşı

31 October 2017 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
UOUğur Odabaşı
Uğur Odabaşı
SÖSibel Özkan
Sibel Özkan

18 October 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
SOSafak Durukan Odabasi
Safak Durukan Odabasi
UOUğur Odabaşı
Uğur Odabaşı
A D-decomposition of a graph (or digraph) G is a partition of the edge set (or arc set) of G into subsets, where each subset induces a copy of the fixed graph D. Graph decomposition finds motivation in numerous practical applications, particularly in the realm of symmetric graphs, where these decompositions illuminate intricate symmetrical patterns within the graph, aiding in various fields such as network design, and combinatorial mathematics, among various others. Of particular interest is the case where G is K*λKv*, the λ-fold complete symmetric digraph on v vertices, that is, the digraph with λ directed edges in each direction between each pair of vertices. For a given digraph D, the set of all values v for which K*λKv* has a D-decomposition is called the λ-fold spectrum of D. An eight-cycle has 22 non-isomorphic orientations. The λ-fold spectrum problem has been solved for one of these oriented cycles. In this paper, we provide a complete solution to the λ-fold spectrum problem for each of the remaining 21 orientations.

16 October 2021 in Electronic Journal of Graph Theory and Applications
Verified
Journal Article
Open access
PDF file
UOUğur Odabaşı
Uğur Odabaşı
DRDan Roberts
Dan Roberts
RLRichard M. Low
Richard M. Low
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there exists an edge labeling f : E(G)→A ∖ {0A} such that the induced vertex labeling f+(v)=∑{u, v}∈E(G)f({u, v}) is a one-to-one map. The integer-antimagic spectrum of a graph G is the set IAM (G)={k : G is ℤk-antimagic and k ≥ 2}. In this paper, we determine the integer-antimagic spectra for all Hamiltonian graphs.