5 citations · 12 across the 12 of their papers we have counts for
13 papers
Graph polynomials: some questions on the edge
Graham Farr, Kerri Morgan
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly o…
Finding Maximum Cliques in Large Networks
S. Y. Chan, K. Morgan, J. Ugon
There are many methods to find a maximum (or maximal) clique in large networks. Due to the nature of combinatorics, computation becomes exponentially expensive as the number of ver…
Exact Counts of s in Blow-Up Graphs
S. Y. Chan, K. Morgan, J. Ugon
Cycles have many interesting properties and are widely studied in many disciplines. In some areas, maximising the counts of -cycles are of particular interest. A natural candida…
Bounds On The Inducibility Of Double Loop Graphs
Su Yuan Chan, Kerri Morgan, Julien Ugon
In the area of extremal graph theory, there exists a problem that investigates the maximum induced density of a -vertex graph in any -vertex graph . This is known as t…
Supernodes
Su Yuan Chan, Kerri Morgan, Nick Parsons +1
In this paper, we present two new concepts related to subgraph counting where the focus is not on the number of subgraphs that are isomorphic to some fixed graph , but on the fr…
Observement as Universal Measurement
David G. Green, Kerri Morgan, Marc Cheong
Measurement theory is the cornerstone of science, but no equivalent theory underpins the huge volumes of non-numerical data now being generated. In this study, we show that replaci…
Instance Space Analysis for the Car Sequencing Problem
Yuan Sun, Samuel Esler, Dhananjay Thiruvady +3
We investigate an important research question for solving the car sequencing problem, that is, which characteristics make an instance hard to solve? To do so, we carry out an insta…
A survey of repositories in graph theory
Srinibas Swain, C. Paul Bonnington, Graham Farr +1
Since the pioneering work of R. M. Foster in the 1930s, many graph repositories have been created to support research in graph theory. This survey reviews many of these graph repos…
Further Results on an Abstract Model for Branching and its Application to Mixed-Integer Programming
Daniel Anderson, Pierre Le Bodic, Kerri Morgan
A key ingredient in branch and bound (B&B) solvers for mixed-integer programming (MIP) is the selection of branching variables since poor or arbitrary selection can affect the size…
Factorisation of Greedoid Polynomials of Rooted Digraphs
Kai Siong Yow, Kerri Morgan, Graham Farr
Gordon and McMahon defined a two-variable greedoid polynomial for any greedoid . They studied greedoid polynomials for greedoids associated with rooted graphs and…
Tutte Invariants for Alternating Dimaps
Kai Siong Yow, Graham Farr, Kerri Morgan
An alternating dimap is an orientably embedded Eulerian directed graph where the edges incident with each vertex are directed inwards and outwards alternately. Three reduction oper…
Algebraic properties of chromatic roots
Peter J. Cameron, Kerri Morgan
A \emph{chromatic root} is a root of the chromatic polynomial of a graph. Any chromatic root is an algebraic integer. Much is known about the location of chromatic roots in the rea…
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
Tim Dwyer, Christopher Mears, Kerri Morgan +3
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbour…