4 citations · 4 across the 1 of their papers we have counts for
4 papers
Characterizing cospectral vertices via isospectral reduction
Mark Kempton, John Sinkovic, Dallas Smith +1
Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relati…
Average mixing matrix of trees
Chris Godsil, Krystal Guo, John Sinkovic
We investigate the rank of the average mixing matrix of trees, with all eigenvalues distinct. The rank of the average mixing matrix of a tree on vertices with distinct eige…
Minimal obstructions for tree-depth: A non-1-unique example
Michael D. Barrus, John Sinkovic
A k-ranking of a graph G is a labeling of the vertices of G with values from 1,...,k such that any path joining two vertices with the same label contains a vertex having a higher l…
Classes of critical graphs for tree-depth
Michael D. Barrus, John Sinkovic
A k-ranking of a graph G is a labeling of the vertices of G with values from {1,...,k} such that any path joining two vertices with the same label contains a vertex having a higher…