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.

(FAB05_058) The cathedral precinct: ideal and contingency

Henry-Russell Hitchcock, in his review of High Victorian Gothic architecture in Australia, writes that the Anglican Cathedral in Brisbane is perhaps the finest. John Loughborough and Frank Loughborough Pearson's designs for Brisbane embody the full ideal of the nineteenth-century English cathedral. While the ideal represented in the cathedral church itself might be readily appreciated, the more encompassing ideal for housing an entire Anglican cathedral establishment may be less well known and less apparent on the site. Although it is only partly built, St John's is probably the only Anglican cathedral in Australia with a comprehensive nineteenth-century precinct plan.

The interorganizational virtual organization: Defining a Weberian ideal

The concept of the virtual organization (VO) has engendered great interest in the literature, yet there is still little common understanding of the concept, as evidenced by the multitude of labels applied to VOs. In this article, we focus on a “Weberian-ideal-type” definition of the interorganizational VO, posited in our earlier work (Kasper-Fuehrer and Ashkanasy 2001). We argue, however, that this definition left unanswered critical questions relating to the nature and effects of interorganizational VOs. We answer these questions here by explicating the terms in the definition and deriving ten corollaries, or “natural consequences” of our definition. The corollaries posit that interorganizational VOs are temporary in nature, are network organizations, are independent, and are based on swift trust. We suggest further that interorganizational VOs enable small to medium enterprises to exploit market opportunities, and enable VO member organizations to create a value-adding partnership. We also identify information and communication technology (ICT) as the essential enabler of VOs. Finally, we argue that interorganizational VOs act as a single organizational unit and that they therefore constitute a uniquely distinguishable organizational form. We conclude with suggestions for further research, including trust, organizational behavior, transaction economics, virtual HRM, and business strategy.

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.

Undergraduate teaching of ideal and real fluid flows: The value of real-world experimental projects

This study describes the pedagogical impact of real-world experimental projects undertaken as part of an advanced undergraduate Fluid Mechanics subject at an Australian university. The projects have been organised to complement traditional lectures and introduce students to the challenges of professional design, physical modelling, data collection and analysis. The physical model studies combine experimental, analytical and numerical work in order to develop students’ abilities to tackle real-world problems. A first study illustrates the differences between ideal and real fluid flow force predictions based upon model tests of buildings in a large size wind tunnel used for research and professional testing. A second study introduces the complexity arising from unsteady non-uniform wave loading on a sheltered pile. The teaching initiative is supported by feedback from undergraduate students. The pedagogy of the course and projects is discussed with reference to experiential, project-based and collaborative learning. The practical work complements traditional lectures and tutorials, and provides opportunities which cannot be learnt in the classroom, real or virtual. Student feedback demonstrates a strong interest for the project phases of the course. This was associated with greater motivation for the course, leading in turn to lower failure rates. In terms of learning outcomes, the primary aim is to enable students to deliver a professional report as the final product, where physical model data are compared to ideal-fluid flow calculations and real-fluid flow analyses. Thus the students are exposed to a professional design approach involving a high level of expertise in fluid mechanics, with sufficient academic guidance to achieve carefully defined learning goals, while retaining sufficient flexibility for students to construct there own learning goals. The overall pedagogy is a blend of problem-based and project-based learning, which reflects academic research and professional practice. The assessment is a mix of peer-assessed oral presentations and written reports that aims to maximise student reflection and development. Student feedback indicated a strong motivation for courses that include a well-designed project component.

A review of the use of the basic cation saturation ratio and the "ideal" soil

The use of 'balanced' Ca, Mg, and K ratios, as prescribed by the basic cation saturation ratio (BCSR) concept, is still used by some private soil-testing laboratories for the interpretation of soil analytical data. This review aims to examine the suitability of the BCSR concept as a method for the interpretation of soil analytical data. According to the BCSR concept, maximum plant growth will be achieved only when the soil’s exchangeable Ca, Mg, and K concentrations are approximately 65 % Ca, 10 % Mg, and 5 % K (termed the ‘ideal soil’). This ‘ideal soil’ was originally proposed by Firman Bear and co-workers in New Jersey (USA) during the 1940s as a method of reducing luxury K uptake by alfalfa (Medicago sativa L.). At about the same time, William Albrecht, working in Missouri (USA), concluded through his own investigations that plants require a soil with a high Ca saturation for optimal growth. Whilst it now appears that several of Albrecht’s experiments were fundamentally flawed, the BCSR (‘balanced soil’) concept has been widely promoted, suggesting that the prescribed cationic ratios provide optimum chemical, physical, and biological soil properties. Our examination of data from numerous studies (particularly those of Albrecht and Bear, themselves) would suggest that, within the ranges commonly found in soils, the chemical, physical, and biological fertility of a soil is generally not influenced by the ratios of Ca, Mg, and K. The data do not support the claims of the BCSR, and continued promotion of the BCSR will result in the inefficient use of resources in agriculture and horticulture.

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).

C4-saturated bipartite graphs

Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)\E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved.

Ideal soliton environment using parametric band gaps

Simultaneous solitary wave solutions for laser propagation in nonlinear parametric media with up to (3 + 1) dimensions are proved to exist. The combination of the large dispersion of a Bragg grating and the strong nonlinearity of chi((2)) optical material results in stable behavior with short interaction distances and low power requirements. The solutions are obtained by using the effective mass approximation to reduce the coupled propagation equations to those describing a dispersive parametric nonlinear waveguide, and are verified by solving the complete set of coupled band-gap equations numerically.

Strong Grobner bases for polynomials over a principal ideal ring

Grobner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Grobner bases, also known as D-bases. Several authors have shown that strong Grobner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Grobner bases and strong Grobner bases when A is a principal ideal ring. We also give algorithms for computing Grobner bases and strong Grobner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Grobner basis over a finite-chain ring, for example a Galois ring.