S-Distance in Trees. - Garry L. Johns; Tai-Chi Lee (Great Lakes Computer Science Conference, 1989)

Directed distance in digraphs: Centers and medians. - Gary Chartrand; Garry L. Johns; Songlin Tian; Steven J. Winters (J. Graph Theory, 1993)

A simple proof of the characterization of antipodal graphs. - Garry L. Johns (Discret. Math., 1994)

A Sharp Bound for the Marginal Appendage Number. - Garry L. Johns (Electron. Notes Discret. Math., 2002)

Boundary vertices in graphs. - Gary Chartrand; David Erwin; Garry L. Johns; Ping Zhang 004 (Discret. Math., 2003)

On the Detour Number and Geodetic Number of a Graph. - Gary Chartrand; Garry L. Johns; Ping Zhang 004 (Ars Comb., 2004)

The rainbow connectivity of a graph. - Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 004 (Networks, 2009)

The Rainbow Connectivities of Small Cubic Graphs. - Garry L. Johns; Futaba Okamoto; Ping Zhang 004 (Ars Comb., 2012)

Hamiltonian-colored powers of strong digraphs. - Garry L. Johns; Ryan C. Jones; Kyle Kolasinski; Ping Zhang 004 (Discuss. Math. Graph Theory, 2012)

On the connectedness of 3-line graphs. - Khawlah H. Alhulwah; Garry L. Johns; Ping Zhang 004 (Australas. J Comb., 2018)