3 papers
math.CO2020
Counting five-node subgraphs
Steve Lawford
We propose exact count formulae for the 21 topologically distinct non-induced connected subgraphs on five nodes, in simple, unweighted and undirected graphs. We prove the main resu…
cs.SI2018
Subgraphs and motifs in a dynamic airline network
Marius Agasse-Duval, Steve Lawford
How does the small-scale topological structure of an airline network behave as the network evolves? To address this question, we study the dynamic properties of small undirected su…
cs.SI2018
Cliques and a new measure of clustering: with application to U.S. domestic airlines
Steve Lawford, Yll Mehmeti
We propose a higher-order generalization of the well-known overall clustering coefficient for triples to any number of nodes. We give analytic formulae for the special cases…