Lynne L. Doty

According to our database, Lynne L. Doty authored at least 9 papers between 1988 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Bounding neighbor-connectivity of Abelian Cayley graphs.

Lynne L. Doty

Discuss. Math. Graph Theory, 2011

2009

Constructing a large class of supertough graphs.

Lynne L. Doty, Kevin K. Ferland

Australas. J Comb., 2009

2008

Some Maximally Tough Circulants.

Lynne L. Doty, Kevin Ferland

Ars Comb., 2008

2006

A new bound for neighbor-connectivity of Abelian Cayley graphs.

Lynne L. Doty

Discret. Math., 2006

2005

Supertough graphs need not be K_{1, 3}-free.

Lynne L. Doty, Kevin K. Ferland

Australas. J Comb., 2005

1996

Cayley Graphs with Neighbor Connectivity One.

Lynne L. Doty, R. J. Goldstone, Charles L. Suffel

SIAM J. Discret. Math., 1996

1990

On the construction of optimally reliable graphs.

Derek H. Smith, Lynne L. Doty

Networks, 1990

1989

Extremal connectivity and vulnerability in graphs.

Lynne L. Doty

Networks, 1989

1988

On graphs with signed inverses.

Fred Buckley, Lynne L. Doty, Frank Harary

Networks, 1988