10 citations · 56 across the 26 of their papers we have counts for
22 papers · 1 filter
The Zero Forcing Number of Twisted Hypercubes
Peter Collier, Jeannette Janssen
Twisted hypercubes are graphs that generalize the structure of the hypercube by relaxing the symmetry constraint while maintaining degree-regularity and connectivity. We study the…
An approximation algorithm for zero forcing
Ben Cameron, Jeannette Janssen, Rogers Matthew +1
We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of , where is the pathwidth of . Starting from…
Orthogonal Colourings of Random Geometric Graphs
Jeannette Janssen, Kyle MacKeigan
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same…
A noncommutative approach to the graphon Fourier transform
Mahya Ghandehari, Jeannette Janssen, Nauzer Kalyaniwalla
Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large g…
Uniform Embeddings for Robinson Similarity Matrices
Jeannette Janssen, Zhiyuan Zhang
A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0,…
Graph sequences sampled from Robinson graphons
Mahya Ghandehari, Jeannette Janssen
The function on the space of graphons, introduced in [CGH15], aims to measure the extent to which a graphon exhibits the Robinson property: for all , $w(x,z)\leq…