Search Results - "Yazıcı, Emine Şule"

Orthogonal cycle systems with cycle length less than 10 by Küçükçifçi, Selda, Yazıcı, Emine Şule

“…An ‐decomposition of a graph is a partition of the edge set of into subsets, where each subset induces a copy of the graph . A ‐orthogonal ‐decomposition of is…”
Get full text

The number of common flowers of two S T S ( v ) s and embeddable Steiner triple trades by Yazıcı, Emine Şule

Get full text

Decomposing complete multipartite graphs into closed trails of arbitrary even lengths by Smith, Benjamin R., Küçükçifçi, Selda, Yazıcı, Emineşule

“…We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths. Copyright © 2011 Wiley…”
Get full text

Square integer Heffter arrays with empty cells by Archdeacon, D. S., Dinitz, J. H., Donovan, D. M., Yazıcı, Emine Şule

“…A Heffter array H ( m , n ; s , t ) is an m × n matrix with nonzero entries from Z 2 m s + 1 such that (i) each row contains s filled cells and each column…”
Get full text

On maximal partial Latin hypercubes by Donovan, Diane M., Grannell, Mike J., Yazıcı, Emine Şule

“…A lower bound is presented for the minimal number of filled cells in a maximal partial Latin hypercube of dimension d and order n . The result generalises and…”
Get full text

A polynomial embedding of pairs of orthogonal partial Latin squares by Donovan, Diane M., Şule Yazıcı, Emine

“…We show that a pair of orthogonal partial Latin squares of order n can be embedded in a pair of orthogonal Latin squares of order at most 16n4 and all orders…”
Get full text

The number of common flowers of two STS(v)s and embeddable Steiner triple trades by Yazıcı, Emine Şule

“…A flower, FS(x), around a point x in a Steiner triple system D=(V,B) is the set of all triples in B which contain the point x, namely FD(x)={b∈B∣x∈b}. This…”
Get full text

Minimal homogeneous latin trades by Cavenagh, Nicholas J., Donovan, Diane M., Şule Yazıcı, Emine

“…A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A d-homogeneous latin trade is one which…”
Get full text

On The Spectrum of Minimal Defining Sets of Full Designs by Demirkale, Fatih, Yazıcı, Emine Şule

“…A defining set of a t -( v , k , λ) design is a subcollection of the block set of the design which is not contained in any other design with the same…”
Get full text

Orthogonal Trades and the Intersection Problem for Orthogonal Arrays by Demirkale, Fatih, Donovan, Diane M., Küçükçifçi, Selda, Yazıcı, Emine Şule

“…This work provides an orthogonal trade for all possible volumes N ∈ Z + \ { 1 , 2 , 3 , 4 , 5 , 7 } for block size 4. All orthogonal trades of volume N ⩽ 15…”
Get full text

Embedding partial Latin squares in Latin squares with many mutually orthogonal mates by Donovan, Diane M, Grannell, Mike, Yazıcı, Emine Şule

“…We show that any partial Latin square of order $n$ can be embedded in a Latin square of order at most $16n^2$ which has at least $2n$ mutually orthogonal…”
Get full text

Defining Sets of Full Designs with Block Size Three II by Donovan, Diane, Lefevre, James, Waterhouse, Mary, Yazıcı, Emine Şule

“…A defining set of a t −( v , k , λ ) design is a subcollection of its blocks which is contained in a unique t -design with the given parameters. A minimal…”
Get full text

Almost 2-perfect 8-cycle systems by Küçükçifçi, Selda, Lindner, Charles Curtis, Özkan, Sibel, Yazıcı, Emine Şule

“…For an $m$-cycle $C$, an inside $m$-cycle of $C$ is a cycle on the same vertex set, that is edge-disjoint from $C$. In an $m$-cycle system, $(\mathcal{X},…”
Get full text

An analytical framework for self-organizing peer-to-peer anti-entropy algorithms by Özkasap, Öznur, Çağlar, Mine, Yazıcı, Emine Şule, Küçükçifçi, Selda

“…An analytical framework is developed for establishing exact performance measures for peer-to-peer (P2P) anti-entropy paradigms used in biologically inspired…”
Get full text

On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs by Kolotolu, Emre, Yazici, Emine Sule

“…A defining set of a t -( v , k , λ ) design is a partial design which is contained in a unique t -design with the given parameters. A minimal defining set is a…”
Get full text

On Defining Sets of Full Designs with Block Size Three by Donovan, Diane, Lefevre, James, Waterhouse, Mary, Yazıcı, Emine Şule

“…A defining set of a t -( v , k , λ ) design is a subcollection of its blocks which is contained in no other t -design with the given parameters, on the same…”
Get full text

Minimal homogeneous Steiner 2- ( v , 3 ) trades by Cavenagh, Nicholas J., Donovan, Diane M., Yazıcı, Emine Şule

“…A Steiner 2- ( v , 3 ) trade is a pair ( T 1 , T 2 ) of disjoint partial Steiner triple systems, each on the same set of v points, such that each pair of…”
Get full text

Metamorphosis of 2-fold 4-cycle systems into maximum packings of 2-fold 6-cycle systems by Yazici, Emine Sule

“…Let c* = a 6-cycle with a double edge. If we remove the double edge the result is a 6-cycle. Let (X, C) be a 2-fold 4-cycle system without repeated 4-cycles…”
Get full text

Estimates of the coverage of parameter space by Latin Hypercube and Orthogonal sampling: connections between Populations of Models and Experimental Designs by Donovan, Diane, Burrage, Kevin, Burrage, Pamela, McCourt, Thomas A, Thompson, Harold Bevan, Yazici, Emine Sule

“…In this paper we use counting arguments to prove that the expected percentage coverage of a $d$ dimensional parameter space of size $n$ when performing $k$…”
Get full text

Metamorphosis of 2-fold 4-cycle systems into maximum packings of 2-fold 6-cycle systems by Yazici, Emine Sule

“…Let c* = a 6-cycle with a double edge. If we remove the double edge the result is a 6-cycle. Let (X, C) be a 2-fold 4-cycle system without repeated 4-cycles…”
Get full text