1,235 research outputs found
Aldred, Mabelle
No full textBody cremated. R. H. Aldred - husband.https://stars.library.ucf.edu/cfm-ch-memoranda-1931/1399/thumbnail.jp
Corrigendum to "Graphs and digraphs with all 2--factors isomorphic" [J. of Comb. Th. Ser. B 92, (2) (2004) 395--404]
No full textWe point out several errors in our article [M. Abreu, R.E.L. Aldred, M. Funk, B. Jackson, D. Labbate, J. Sheehan, Graphs and digraphs with all 2-factor isomorphic, J. Combin. Theory Ser. B 92 (2004) 395–404] which were caused by our misquoting of a theorem of C. Thomassen. We also describe how the correct statement of Thomassen’s theorem, together with another of his theorems, can be used to obtain weaker results than those incorrectly stated in our original article
Restricted matching in graphs of small genus
No full textAbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every set of n disjoint edges in G extends to (i.e., is a subset of) a perfect matching. More generally, a graph is said to have property E(m,n) if, for every matching M of size m and every matching N of size n in G such that M∩N=0̸, there is a perfect matching F in G such that M⊆F, but F∩N=0̸. G is said to have property E(0,0) if it has a perfect matching. The study of the properties E(m,n) is referred to as the study of restricted matching extension.In [M. Porteous, R. Aldred, Matching extensions with prescribed and forbidden edges, Australas. J. Combin. 13 (1996) 163–174; M. Porteous, Generalizing matching extensions, M.A. Thesis, University of Otago, 1995; A. McGregor-Macdonald, The E(m,n) property, M.Sc. Thesis, University of Otago, 2000], Porteous and Aldred, Porteous and McGregor-Macdonald, respectively, studied the possible implications among the properties E(m,n) for various values of m and n. In an earlier paper [R.E.L. Aldred, Michael D. Plummer, On restricted matching extension in planar graphs, in: 17th British Combinatorial Conference (Canterbury 1999), Discrete Math. 231 (2001) 73–79], the present authors completely determined which of the various properties E(m,n) always hold, sometimes hold and never hold for graphs embedded in the plane. In the present paper, we do the same for embeddings in the projective plane, the torus and the Klein bottle
Aldred's multiple glosses: a study of ordering preferences
No full textThe Old English gloss to the Lindisfarne Gospels (ca 950) is a key text for our understanding of the
linguistic features of Late Old Northumbrian. The main focus of the paper will be a study of the lexical
make-up of Aldred the glossator’s idiolect, which will be determined by analysing the multiple glosses
which include (near-)synonymous interpretamenta. I aim to establish the frequency with which the
terms included in such glosses render their Latin lemma(ta) either by themselves or in a multiple gloss,
and their position in multiple glosses. It has been suggested that Aldred might have perceived the
second or subsequent terms in a multiple gloss as more easily understood, but no thorough study of this
issue has been conducted yet.
This analysis will hopefully throw light on the integration of the Old Norse loans recorded in the
glosses into Aldred’s lexicon, as they commonly appear in multiple glosses, either as the first or a
subsequent member. Aldred’s vocabulary in this respect is particularly interesting because, in clear
contrast with near-contemporary texts, the Lindisfarne gloss includes a significant number of nontechnical
loans, which suggests a more advanced state of Anglo-Scandinavian linguistic contact.
If there is enough time, Aldred’s practices will be compared with those followed by Owun, the author
of the Old Northumbrian gloss to the Rushworth Gospels, in an attempt to move from a person’s
idiolect to a wider dialectal view
Regular bipartite graphs with all 2-factors isomorphic
No full textThe Heawood graph and the complete bipartite graph have the property that all of their 2-factors are
hamiltonian cycles. We call such graphs 2-factor hamiltonian. In this paper, we study k-regular bipartite graphs with the apparently more
general property that all their 2-factors are isomorphic.
We prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then
Characterisation of stachybotrys chartarum from water damaged buildings
No full textFungal contaminated buildings and related adverse human health implications have long been a topical issue throughout the world and concern is mounting with regards to the presence of more toxigenic fungi found in buildings and the associated health risks. These risks are compounded when homes are affected by water damage as a result of water intrusion problems, in particular flooding. With the ever changing climate and unpredictable weather conditions the frequency of flash flooding has increased in recent years and is set to increase and subsequently more homes will inevitably be effected by mould contamination. The present study initially aimed to determine the types of fungi commonly detected in buildings in the United Kingdom with varied levels of water intrusion problems via a small survey using various sampling techniques and particularly aimed to determine the conditions by which growth of the toxigenic fungi Stachybotrys chartarum could occur. Penicillium, Cladosporium and Aspergillus species were the most commonly detected fungi in buildings with relatively moderate levels of water intrusion problems; Stacybotrys chartarum was only detected in building with more severe water intrusion problems. Cont/d
Post-harvest control strategies: Minimizing mycotoxins in the food chain.
No full textContamination of cereal commodities by moulds and mycotoxins results in dry matter, quality, and nutritional losses and represents a significant hazard to the food chain. Most grain is harvested, dried and then stored on farm or in silos for medium/long term storage. Cereal quality is influenced by a range of interacting abiotic and biotic factors. In the so-called stored grain ecosystem, factors include grain and contaminant mould respiration, insect pests, rodents and the key environmental factors of temperature, water availability and intergranular gas composition, and preservatives which are added to conserve moist grain for animal feed. Thus knowledge of the key critical control points during harvesting, drying and storage stages in the cereal production chain are essential in developing effective prevention strategies post-harvest. Studies show that very small amounts of dry matter loss due to mould activity can be tolerated. With 75% are required to ensure that growth of mycotoxigenic moulds does not occur in partially dried grain. Sometimes, preservatives based on aliphatic acids have been used to prevent spoilage and mycotoxin contamination of stored commodities, especially feed. These are predominantly fungistats and attempts have been made to use alternatives such as essential oils and anti-oxidants to prevent growth and mycotoxin accumulation in partially dried grain. Interactions between spoilage and mycotoxigenic fungi and insect pests inevitably occurs in stored grain ecosystems and this can further influence contamination with mycotoxins. Effective post-harvest management of stored commodities requires clear monitoring criteria and effective implementation in relation to abiotic and biotic factors, hygiene and monitoring to ensure that mycotoxin contamination is minimised and that stored grain can proceed through the food chain for processing
Graphs and Digraphs with all 2-factors isomorphic
No full textWe show that a digraph which contains a directed 2-factor and has minimum in-degree and outdegree at least four has two non-isomorphic directed 2-factors. As a corollary, we deduce that every graph which contains a 2-factor and has minimum degree at least eight has two non-isomorphic 2-factors. In addition we construct: an infinite family of 3-diregular digraphs with the property that all their directed 2-factors are Hamilton cycles, an infinite family of 2-connected 4-regular graphs with the
property that all their 2-factors are isomorphic, and an infinite family of cyclically 6-edge-connected cubic graphs with the property that all their 2-factors are Hamilton cycles
- …
