#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2004

2014

- This year (0)
- Last 5 years (5)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- A.-L. Daniau, Patrick J. Bartlein, +58 authors Y. Zhang
- 2012

A.-L. Daniau, P. J. Bartlein, S. P. Harrison, I. C. Prentice, S. Brewer, P. Friedlingstein, T. I. Harrison-Prentice, J. Inoue, K. Izumi, J. R. Marlon, S. Mooney, M. J. Power, J. Stevenson, W. Tinner, M. Andrič, J. Atanassova, H. Behling,M. Black, O. Blarquez, K. J. Brown, C. Carcaillet, E. A. Colhoun, D. Colombaroli, B. A. S. Davis, D. D’Costa, J. Dodson,… (More)

- Peter Hamburger, Attila Pór, Matt Walsh
- SIAM J. Discrete Math.
- 2009

The Kneser graph Kn:k for positive integers n ≥ k has as its vertex set the k-element subsets of some n-set, with disjoint sets being adjacent. Every finite simple graph can be found as an induced subgraph of some Kneser graph; this can be viewed as a way of representing graphs by labelling their vertices with sets. We explore questions of finding the… (More)

- John Wright, John Bibby, +9 authors John B Young
- Quality & safety in health care
- 2007

OBJECTIVE
To evaluate clinical and cost effectiveness of implementing evidence-based guidelines for the prevention of stroke.
DESIGN
Cluster-randomised trial
SETTING
Three primary care organisations in the North of England covering a population of 400,000.
PARTICIPANTS
Seventy six primary care teams in four clusters: North, South & West, City I and… (More)

- Peter Hamburger, Robert C. Vandell, Matt Walsh
- Discrete Applied Mathematics
- 2007

A function f : V (G) → {0, 1, 2} is a Roman dominating function if for every vertex with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. We introduce two fractional Roman domination parameters, γR ◦ f and γRf , from relaxations of two equivalent integer programming formulations of Roman domination (the former using open neighborhoods and the later… (More)

- Matt Walsh
- Discussiones Mathematicae Graph Theory
- 2007

Mynhardt has conjectured that if G is a graph such that γ(G) = γ(πG) for all generalized prisms πG then G is edgeless. The fractional analogue of this conjecture is established and proved by showing that, if G is a graph with edges, then γf (G×K2) > γf (G).

- Matt Walsh, Steve Hancock, +7 authors Dendy E. Sloan
- 2008

Economic studies on simulated natural gas hydrate reservoirs have been compiled to estimate the price of natural gas that may lead to economically viable production from the most promising gas hydrate accumulations. As a first estimate, large-scale production of natural gas from North American arctic region Class 1 and Class 2 hydrate deposits will be… (More)

- David A. Pike, Robert C. Vandell, Matt Walsh
- Discrete Mathematics
- 2009

Given a combinatorial designD with block set B, its traditional block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and only if b1 and b2 have non-empty intersection. In this paper we consider the S-block-intersection graph, in which two vertices b1 and b2 are adjacent if and only if |b1 ∩ b2| ∈ S.… (More)

- Robert C. Vandell, Matt Walsh, William D. Weakley
- Electr. J. Comb.
- 2014

Let G be a finite simple graph of order n, maximum degree ∆, and minimum degree δ. A compact regularization of G is a ∆-regular graph H of which G is an induced subgraph: H is symmetric if every automorphism of G can be extended to an automorphism of H. The index |H : G| of a regularization H of G is the ratio |V (H)|/|V (G)|. Let mcr(G) denote the index of… (More)

- Matt Walsh
- Interactions
- 2013

when opposing forces are aligned. Whether it be tectonic plates pushing against each other, religious sects debating ideology, or two suitors trying to impress the same girl, the tension builds. However, as this tension mounts, something else happens as well: Potential energy is created. The more these forces push against each other, the more potential… (More)