27 citations · 73 across the 20 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Modularity of regular and treelike graphs
Colin McDiarmid, Fiona Skerman
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a grap…
cs.IT2016
Guessing Numbers of Odd Cycles
Ross Atkins, Puck Rombach, Fiona Skerman
For a given number of colours, , the guessing number of a graph is the base logarithm of the size of the largest family of colourings of the vertex set of the graph such tha…