Gordon Royle

ORCID: 0000-0003-2669-4437
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • graph theory and CDMA systems
  • Advanced Graph Theory Research
  • Finite Group Theory Research
  • Coding theory and cryptography
  • Graph theory and applications
  • Graph Labeling and Dimension Problems
  • Limits and Structures in Graph Theory
  • Advanced Combinatorial Mathematics
  • Geometric and Algebraic Topology
  • Atrial Fibrillation Management and Outcomes
  • semigroups and automata theory
  • Venous Thromboembolism Diagnosis and Management
  • Topological and Geometric Data Analysis
  • Chronic Lymphocytic Leukemia Research
  • Interconnection Networks and Systems
  • Algebraic Geometry and Number Theory
  • Polynomial and algebraic computation
  • Matrix Theory and Algorithms
  • Advanced Algebra and Logic
  • Advanced Topology and Set Theory
  • Digital Image Processing Techniques
  • Mathematics and Applications
  • Spectral Theory in Mathematical Physics
  • Myeloproliferative Neoplasms: Diagnosis and Treatment
  • Stochastic processes and statistical mechanics

The University of Western Australia
2012-2023

Middlemore Hospital
2007-2023

Counties Manukau District Health Board
2015-2021

University of Auckland
1991-2018

University of Primorska
2018

John Wiley & Sons (United States)
2016

Hudson Institute
2016

Garvan Institute of Medical Research
2007

Oregon Health & Science University
1997

Portland VA Medical Center
1997

Idarucizumab, a monoclonal antibody fragment, was developed to reverse the anticoagulant effect of dabigatran. We performed multicenter, prospective, open-label study determine whether 5 g intravenous idarucizumab would be able dabigatran in patients who had uncontrolled bleeding (group A) or were about undergo an urgent procedure B). The primary end point maximum percentage reversal within 4 hours after administration idarucizumab, on basis diluted thrombin time ecarin clotting time....

10.1056/nejmoa1707278 article EN New England Journal of Medicine 2017-07-11

Abstract We consider the location of zeros four related classes polynomials, one which is class chromatic polynomials graphs. All these are generating functions combinatorial interest. Extensive calculations indicate that often have only real zeros, and we give a variety theoretical results begin to explain this phenomenon. In course investigation prove number interesting identities also some new sufficient conditions for polynomial zeros.

10.4153/cjm-1994-002-3 article EN Canadian Journal of Mathematics 1994-02-01

10.1016/j.jctb.2007.07.005 article EN publisher-specific-oa Journal of Combinatorial Theory Series B 2007-09-26

10.1016/j.jctb.2006.04.002 article EN publisher-specific-oa Journal of Combinatorial Theory Series B 2006-05-20

10.1016/j.jsc.2019.06.006 article EN publisher-specific-oa Journal of Symbolic Computation 2019-06-27

Ca(2+)-permeable-AMPA receptors (AMPARs) are expressed in the superficial dorsal horn (SDH, laminae I/II) of spinal cord, area involved transmission and modulation sensory information, including nociception. A possible role Ca(2+)-permeable-AMPARs synaptic strengthening has been suggested postnatal DH cultures, but their long-lasting activity-dependent plasticity primary afferent neurotransmission adult mouse SDH not investigated. In present study regulation plasticity, specifically...

10.1016/j.pain.2007.07.001 article EN Pain 2007-09-11

The Tutte polynomial of a graph, also known as the partition function q -state Potts model is 2-variable graph invariant considerable importance in both combinatorics and statistical physics. It contains several other invariants, such chromatic flow partial evaluations, various numerical invariants number spanning trees complete evaluations. However despite its ubiquity, there are no widely available effective computational tools able to compute general reasonable size. In this article we...

10.1145/1824801.1824802 article EN ACM Transactions on Mathematical Software 2010-09-01

Abstract In this article we give examples of a triangle‐free graph on 22 vertices with chromatic number 5 and K 4 ‐free 11 5. We very briefly describe the computer searches demonstrating that these are smallest possible such graphs. All 5‐critical graphs 9 exhibited. © 1995 John Wiley & Sons, Inc.

10.1002/jgt.3190190111 article EN Journal of Graph Theory 1995-01-01

10.1016/j.jctb.2004.03.008 article EN Journal of Combinatorial Theory Series B 2004-05-31

10.1007/s00026-011-0094-5 article EN Annals of Combinatorics 2011-05-14

We prove that every flock generalized quadrangle contains a hemisystem, and we provide construction method unifies our results with the examples of Cossidente Penttila in classical case.

10.1112/blms/bdq031 article EN Bulletin of the London Mathematical Society 2010-05-31

10.1016/s0747-7171(87)80068-8 article EN publisher-specific-oa Journal of Symbolic Computation 1987-10-01

We construct by computer all of the hyperovals in 22 known projective planes order 16. Our most interesting result is that four contain no hyperovals, thus providing counterexamples to old conjecture every finite plane contains an oval. © 1996 John Wiley & Sons, Inc.

10.1002/(sici)1520-6610(1996)4:1<59::aid-jcd6>3.0.co;2-z article EN Journal of Combinatorial Designs 1996-01-01
Coming Soon ...