4 papers
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…