Aboriginal and Torres Strait Islander Studies Unit Annual Report

Welcome to the 2002 Aboriginal and Torres Strait Islander Studies Unit Annual Report. This report is a brief summary of Unit activities during the 2002 calendar year. The Unit provides personal and academic support for Aboriginal and Torres Strait Islander students and specifically aims to increase the recruitment, retention, academic performance and graduation rates of Indigenous students. The Unit also administers schemes to help Indigenous students gain access to, and receive support in, tertiary studies such as the Alternative Entry scheme and the federally funded Aboriginal Tutorial Assistance Scheme (ATAS). The Unit is also the focus for teaching and research in Aboriginal and Torres Strait Islander Studies at the University of Queensland.

Aboriginal and Torres Strait Islander Studies Unit Annual Report 2003

Welcome to the 2003 Aboriginal and Torres Strait Islander Studies Unit Annual Report. This report is a brief summary of Unit activities during the 2003 calendar year. The Unit provides personal and academic support for Aboriginal and Torres Strait Islander students and specifically aims to increase the recruitment, retention, academic performance and graduation rates of Indigenous students. The Unit also administers schemes to help Indigenous students gain access to, and receive support in, tertiary studies such as the Alternative Entry scheme and the federally funded Aboriginal Tutorial Assistance Scheme (ATAS). The Unit is also the focus for teaching and research in Aboriginal and Torres Strait Islander Studies at the University of Queensland.

Aboriginal and Torres Strait Islander Studies Unit Annual Report 2005

Welcome to the 2005 Aboriginal and Torres Strait Islander Studies Unit Annual Report. This report is a brief summary of Unit activities during the 2005 calendar year. The Unit provides personal and academic support for Aboriginal and Torres Strait Islander students and specifically aims to increase the recruitment, retention, academic performance and graduation rates of Indigenous students. The Unit also administers schemes to help Indigenous students gain access to, and receive support in, tertiary studies such as the Alternative Entry scheme and the federally-funded Indigenous Tutorial Assistance Scheme (ITAS). The Unit is also the focus for teaching and research in Aboriginal and Torres Strait Islander Studies at the University of Queensland.

Trades and Graphs

The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.

Packing complete multipartite graphs with 4-cycles

In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.

Decomposition of complete tripartite graphs into gregarious 4-cycles

A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.

Common multiples of complete graphs

A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.

Critical values for unit root and cointegration test statistics - the use of response surface equations

This note considers the value of surface response equations which can be used to calculate critical values for a range of unit root and cointegration tests popular in applied economic research.

Decomposing complete tripartite graphs into cycles of lengths 3 and 4

Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K-r,K-s,K-t into exactly alpha 3-cycles and beta 4-cycles. (C) 1999 Elsevier Science B.V. All rights reserved.

Decompositions of complete multipartite graphs into cycles of even length

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain small decompositions exist, are also given for arbitrary even cycle lengths.

A family of perfect factorisations of complete bipartite graphs

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n = p(2) for an odd prime p. We construct a family of (p-1)/2 non-isomorphic perfect 1-factorisations of K-n,K-n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamiltoilian if the permutation defined by any row relative to any other row is a single Cycle. (C) 2002 Elsevier Science (USA).