Search Results - "Odabasi, Ugur"

Uniformly Resolvable Cycle Decompositions with Four Different Factors by Odabaşı, Uğur, Özkan, Sibel

“…In this paper, we consider uniformly resolvable decompositions of complete graph K v (or K v minus a 1-factor I for even v ) into cycles. We will focus on the…”
Get full text

The integer-antimagic spectra of Hamiltonian graphs by Odabasi, Ugur, Roberts, Dan, Low, Richard M.

“…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…”
Get full text

Decompositions of complete symmetric directed graphs into the oriented heptagons by ODABAŞI, Uğur

Get full text

The λ-Fold Spectrum Problem for the Orientations of the Eight-Cycle by Durukan-Odabaşı, Şafak, Odabaşı, Uğur

“…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…”
Get full text

The directed uniform Hamilton-Waterloo Problem involving even cycle sizes by Yetgin, Fatih, Odabaşi, Uğur, Özkan, Sibel

Get full text

The integer-antimagic spectra of a disjoint union of Hamiltonian graphs by ODABAŞI, UĞUR, ROBERTS, DAN, LOW, RICHARD M.

Get full text

The Spectrum Problem for the Connected Cubic Graphs of Order 10 by Adams, Peter, El-Zanati, Saad I., Odabaşi, Uğur, Wannasit, Wannasiri

“…We show that if is a connected cubic graph of order 10, then there exists a -decomposition of if and only if ≣ 1 or 10 (mod 15) except when = 10 and is one of…”
Get full text

The Iλ/I-Fold Spectrum Problem for the Orientations of the Eight-Cycle by Durukan-Odabaşı, Şafak, Odabaşı, Uğur

“…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…”
Get full text

The Hamilton–Waterloo Problem with C 4 and C m factors by Odabaşı, Uğur, Özkan, Sibel

Get full text

The Hamilton–Waterloo Problem with C4 and Cm factors by Odabaşı, Uğur, Özkan, Sibel

“…The Hamilton–Waterloo problem with uniform cycle sizes asks for a 2-factorization of the complete graph Kv (for odd v) or Kv minus a 1-factor (for even v)…”
Get full text

Decompositions of Complete Symmetric Directed Graphs into the Oriented Heptagons by Odabaşı, Uğur

“…The complete symmetric directed graph of order $v$, denoted $K_{v}^*$, is the directed graph on $v$ vertices that contains both arcs $(x,y)$ and $(y,x)$ for…”
Get full text

The Directed Uniform Hamilton-Waterloo Problem Involving Even Cycle Sizes by Yetgin, Fatih, Odabaşı, Uğur, Özkan, Sibel

“…In this paper, factorizations of the complete symmetric digraph $K_v^*$ into uniform factors consisting of directed even cycle factors are studied as a…”
Get full text

On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes by Yetgin, Fatih, Odabaşı, Uğur, Özkan, Sibel

“…The Directed Hamilton-Waterloo Problem asks for a directed $2$-factorization of the complete symmetric digraph $K_v^*$ where there are two non-isomorphic…”
Get full text

The Hamilton-Waterloo Problem with $C_4$ and $C_m$ Factors by Odabaşı, Uğur, Özkan, Sibel

“…The Hamilton-Waterloo problem with uniform cycle sizes asks for a $2-$ factorization of the complete graph $K_v$ (for odd {\em v}) or $K_v$ minus a $1-$factor…”
Get full text