Mark Kempton

Orcid: 0000-0001-5963-0056

According to our database1, Mark Kempton authored at least 14 papers between 2013 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Zero Forcing on 2-connected Outerplanar Graphs.
Graphs Comb., June, 2026

Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem.
Discret. Appl. Math., 2026

Effects of backtracking on PageRank.
Appl. Math. Comput., 2026

2024
A Nordhaus-Gaddum type problem for the normalized Laplacian spectrum and graph Cheeger constant.
Appl. Math. Comput., 2024

2023
Kemeny's constant for nonbacktracking random walks.
Random Struct. Algorithms, September, 2023

2022
SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021
Spectral Threshold for Extremal Cyclic Edge-Connectivity.
Graphs Comb., 2021

2020
State transfer in strongly regular graphs with an edge perturbation.
J. Comb. Theory A, 2020

Spanning 2-forests and resistance distance in 2-connected graphs.
Discret. Appl. Math., 2020

2019
Pretty good quantum state transfer in asymmetric graphs via potential.
Discret. Math., 2019

2017
Pretty good quantum state transfer in symmetric spin networks via magnetic field.
Quantum Inf. Process., 2017

Perfect state transfer on graphs with a potential.
Quantum Inf. Comput., 2017

2014
Ranking and Sparsifying a Connection Graph.
Internet Math., 2014

2013
A Local Clustering Algorithm for Connection Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013


  Loading...