Garry L. Johns

According to our database, Garry L. Johns authored at least 10 papers between 1989 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2018

On the connectedness of 3-line graphs.

Khawlah H. Alhulwah, Garry L. Johns, Ping Zhang

Australas. J Comb., 2018

2012

Hamiltonian-colored powers of strong digraphs.

Garry L. Johns, Ryan C. Jones, Kyle Kolasinski, Ping Zhang

Discuss. Math. Graph Theory, 2012

The Rainbow Connectivities of Small Cubic Graphs.

Garry L. Johns, Futaba Okamoto, Ping Zhang

Ars Comb., 2012

2009

The rainbow connectivity of a graph.

Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, Ping Zhang

Networks, 2009

2004

On the Detour Number and Geodetic Number of a Graph.

Gary Chartrand, Garry L. Johns, Ping Zhang

Ars Comb., 2004

2003

Boundary vertices in graphs.

Gary Chartrand, David Erwin, Garry L. Johns, Ping Zhang

Discret. Math., 2003

2002

A Sharp Bound for the Marginal Appendage Number.

Garry L. Johns

Electron. Notes Discret. Math., 2002

1994

A simple proof of the characterization of antipodal graphs.

Garry L. Johns

Discret. Math., 1994

1993

Directed distance in digraphs: Centers and medians.

Gary Chartrand, Garry L. Johns, Songlin Tian, Steven J. Winters

J. Graph Theory, 1993

1989

S-Distance in Trees.

Garry L. Johns, Tai-Chi Lee

Proceedings of the Computing in the 90's, 1989