Stephen J. Kirkland

dblp:04/1508 · also Stephen Kirkland · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-9496-5553ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1
YearPublicationVenuePosition
2026 Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem
abstract
We study Nordhaus–Gaddum problems for Kemeny’s constant K ( G ) of a connected graph G . We prove bounds on min { K ( G ) , K ( G ¯ ) } and the product K ( G ) K ( G ¯ ) for various families of graphs. In particular, we show that if the maximum degree of a graph G on n vertices is n − O ( 1 ) or n − Ω ( n ) , then min { K ( G ) , K ( G ¯ ) } is at most O ( n ) .
Sooyeong Kim, Neal Madras, Ada Chan, Mark Kempton, Stephen J. Kirkland, Adam Knudson
Discret. Appl. Math.5
2025 Edge addition and the change in Kemeny's constant
Stephen J. Kirkland, Yuqiao Li, John S. McAlister
Discret. Appl. Math.1
2016 Co-optimizing application partitioning and network topology for a reconfigurable interconnect
Deepak Ajwani, Adam Hackett, Shoukat Ali, John P. Morrison, Stephen J. Kirkland
J. Parallel Distributed Comput.5