78 research outputs found
Possible volumes of t-(v, t + 1) Latin trades
The concept of - trades of block designs previously has been
studied in detail. See for example A. S. Hedayat (1990) and Billington (2003).
Also Latin trades have been studied in detail under various names, see A. D.
Keedwell (2004) for a survey. Recently Khanban, Mahdian and Mahmoodian have
extended the concept of Latin trades and introduced \Ts{t}{v}{k}. Here we
study the spectrum of possible volumes of these trades, . Firstly,
similarly to trades of block designs we consider numbers
, , as critical points and then we
show that , for any , and if , then . As an example, we
determine S(3,4) precisely.Comment: 12 page
A new bound on the size of the largest critical set in a Latin square
A critical set in an n x n array is a set C of given entries, such that there
exists a unique extension of C to an n x n Latin square and no proper subset of
C has this property. The cardinality of the largest critical set in any Latin
square of order n is denoted by lcs(n). In 1978 Curran and van Rees proved that
lcs(n) <= n^2 - n. Here we show that lcs(n) <= n^2-3n+3.Comment: 10 pages, LaTe
Totally Silver Graphs
A totally silver coloring of a graph G is a k--coloring of G such that for
every vertex v \in V(G), each color appears exactly once on N[v], the closed
neighborhood of v. A totally silver graph is a graph which admits a totally
silver coloring. Totally silver coloring are directly related to other areas of
graph theory such as distance coloring and domination. In this work, we present
several constructive characterizations of totally silver graphs and bipartite
totally silver graphs. We give several infinite families of totally silver
graphs. We also give cubic totally silver graphs of girth up to 10
On uniquely list colorable graphs
Let G be a graph with n vertices and suppose that for each vertex v in G,
there exists a list of k colors L(v), such that there is a unique proper
coloring for G from this collection of lists, then G is called a uniquely
k-list colorable graph.
Recently M. Mahdian and E.S. Mahmoodian characterized uniquely 2-list
colorable graphs. Here we state some results which will pave the way in
characterization of uniquely k-list colorable graphs. There is a relationship
between this concept and defining sets in graph colorings and critical sets in
latin squares.Comment: 13 page
On the existence of k-homogeneous Latin bitrades
Following the earlier work on {homogeneous Latin bitrades by Cavenagh,
Donovan, and Dr'apal (2003 and 2004) Bean, Bidkhori, Khosravi, and E. S.
Mahmoodian (2005) we prove the following results. All k-homogeneous Latin
bitrades of volume km exist, for 1) all odd number k and m is greater than or
equal to k, 2) all even number k > 2 and m is greater than or equal to min{k
+u,3k/2}, where u is any odd number which divides k, 3) all m is greater than
or equal to k, where k is greater than or equal to 3 and is lesser than or
equal to 37
The Chromatic Number of Finite Group Cayley Tables
The chromatic number of a latin square , denoted , is the minimum
number of partial transversals needed to cover all of its cells. It has been
conjectured that every latin square satisfies . If true,
this would resolve a longstanding conjecture---commonly attributed to
Brualdi---that every latin square has a partial transversal of size .
Restricting our attention to Cayley tables of finite groups, we prove two main
results. First, we resolve the chromatic number question for Cayley tables of
finite Abelian groups: the Cayley table of an Abelian group has chromatic
number or , with the latter case occurring if and only if has
nontrivial cyclic Sylow 2-subgroups. Second, we give an upper bound for the
chromatic number of Cayley tables of arbitrary finite groups. For ,
this improves the best-known general upper bound from to
, while yielding an even stronger result in infinitely many
cases
On the star arboricity of hypercubes
A Hypercube is a graph in which the vertices are all binary vectors of
length n, and two vertices are adjacent if and only if their components differ
in exactly one place. A galaxy or a star forest is a union of vertex disjoint
stars. The star arboricity of a graph , , is the minimum number
of galaxies which partition the edge set of . In this paper among other
results, we determine the exact values of for , . We also improve the last known
upper bound of and show the relation between and
square coloring.Comment: Australas. J. Combin., vol. 59 pt. 2, (2014
A linear algebraic approach to orthogonal arrays and Latin squares
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and
Singhi (1988 and 1994) considered some module spaces. Here, using a linear
algebraic approach we define an inclusion matrix and find its rank. In the
special case of Latin squares we show that there is a straightforward algorithm
for generating a basis for this matrix using the so-called intercalates. We
also extend this last idea.Comment: 11 page
Silver block intersection graphs of Steiner 2-designs
For a block design , a series of {\sf block intersection graphs}
, or -{\rm BIG}(), is defined in which the
vertices are the blocks of , with two vertices adjacent if and only if
the corresponding blocks intersect in exactly elements. A silver graph
is defined with respect to a maximum independent set of , called a {\sf
diagonal} of that graph. Let be -regular and be a proper -coloring of . A vertex in is said to be {\sf rainbow} with
respect to if every color appears in the closed neighborhood . Given a diagonal of , a coloring is said to be silver
with respect to if every is rainbow with respect to . We say
is {\sf silver} if it admits a silver coloring with respect to some .
We investigate conditions for 0-{\rm BIG}() and 1-{\rm
BIG}() of Steiner systems to be silver
On the chromatic number of Latin square graphs
The chromatic number of a Latin square is the least number of partial
transversals which cover its cells. This is just the chromatic number of its
associated Latin square graph. Although Latin square graphs have been widely
studied as strongly regular graphs, their chromatic numbers appear to be
unexplored. We determine the chromatic number of a circulant Latin square, and
find bounds for some other classes of Latin squares. With a computer, we find
the chromatic number for all main classes of Latin squares of order at most
eight
- β¦