Research Publications (1995-1999)

(click on title for abstract)



1995 145. Exact 2-step domination in graphs. (with F. Harary, M. Hossain, and K. Schultz) Math. Bohem. 120 (1995) 125-134.

146. Convergent sequences of iterated H-line graphs. (with H. Gavlas and M. Schultz) Discrete Math. 147 (1995) 73-86.

147. Rotation numbers of multistars. (with M. Frick, H. Hevia, E. B. Jarrett, and F. Saba) Utilitas Math. 48 (1995) 65-73.

148. Distance, stratified graphs, and greatest stratified subgraphs. Congress. Numer. 107 (1995) 81-96. (with L. Eroh, R. Rashidi, M. Schultz, and N. Sherwani)

149. Achievement and avoidance of a strong orientation of a graph. (with F. Harary, M. Schultz, and D. W. VanderJagt) Congress. Numer. 108 (1995) 193-203.

150. A new characterization of the Petersen graph. (with M. A. Henning, H. Hevia and E. B. Jarrett) J. Combin. Inf. Syst. Sci. 20 (1995) 219-227.

1996 151. The greatest common divisor index of a graph. (with W. Goddard, G. Kubicki, C. M. Mynhardt, and F. Saba) J. Combin. Math. Combin. Comput. 20 (1996) 11-26.

152. On least common multiples of digraphs. (with C. M.Mynhardt and F. Saba) Utilitas Math 49 (1996) 45-63.

153. Quadrilateral line graphs. Utilitas Math. (with M. A. Henning, E. B. Jarrett, and C. E. Wall) 50 (1996) 3-17.

154. On eccentric vertices in graphs. (with M. Schultz and S. J. Winters) Networks. 28 (1996) 181-186.

155. Orientable domination in graphs. ' (with B. Q. Yue and D. W. VanderJagt) Congress. Numer. 119 (1996) 51-63.

1997 156. On strong digraphs with a prescribed ultracenter. (with H. Gavlas, K. Schultz, and S. J. Winters) Czech. Math. J. 47 (1997) 83-94.

157. The chromatic number of a factorization of a graph. (with H. Hevia and O. R. Oellermann) Bull. of the ICA 20 (1997) 33-56.

158. Subgraph distances defined by edge transfers. (with H. Hevia, E. B. Jarrett, and M. Schultz) Discrete Math. 170 (1997) 63-79.

159. On graphs with a unique least common multiple. (with G. Kubicki, C. M. Mynhardt, and F. Saba) Ars Combin. 46 (1997) 177-190.

160 Distance in digraphs. Computers Math. Applic. (with S. Tian) 34 (1997) 15-23.

161 The forcing domination number of a graph. (with H. Gavlas, F. Harary, and R. C. Vandell) J. Combin. Math. Combin. Comput. 25 (1997) 161-174.

162 Anticonnected digraphs. (with H. Gavlas, M. Schultz, and C. E. Wall) Utilitas Math. 51 (1997) 41-54.

163 Rotation and jump distances between graphs. (with H. Gavlas, H. Hevia, and M. A. Johnson) Discuss. Math. Graph Theory 17 (1997) 285-300.

164 Stratidistance in stratified graphs. Math. Bohem. (with H. Gavlas, M. A. Henning, and R. Rashidi) 122 (1997) 337-347.

165 Path vectors and optimal trees. (with A. J. Boals, J. Nouh, D. W. VanderJagt, and J. Yates) Congress. Numer. 124 (1997) 145-159.

1998 166. Graph similarity and distance in graphs. Aequationes Math. 55 (1998) 129-145. (with G. Kubicki and M. Schultz)

167. Extremal problems in geodetic graph theory (with F. Harary and P. Zhang). Congr. Numer. 130 (1998) 157-168.

168. On the partition dimension of a graph (with E.Salehi and P. Zhang). Congr. Numer. 131 (1998) 55-66.

169. On the out-domination and in-domination numbers of a digraph. (with F. Harary and B. Q. Yue) Discrete Math. 197/198 (1999) 179-183.


1999 170. Near-automorphisms of graphs. (with H. Gavlas and D. W. VanderJagt) Combinatorics, Graph Theory, and Algorithms. (eds. Y. Alavi, D. R. Lick, and A. Schwenk) New Issues Press, Kalamazoo, MI 1 (1999) 181-192.

171. Degrees in stratified graphs. (with R. Rashidi, F.Saba, and C. E. Wall) Combinatorics, Graph Theory, and Algorithms. (eds. Y. Alavi, D. R. Lick, and A. Schwenk) New Issues Press, Kalamazoo, MI 1 (1999) 193-204.

172. The forcing geodetic number of a graph (with P. Zhang). Discuss. Math. Graph Theory 19 (1999) 45-58.

173. Eccentric graphs. (with W. Gu, M. Schultz, and S. J. Winters) Networks. 34 (1999) 115-121.

174 Realizable ratios in graph theory: geodesic parameters. (with P. Zhang). Bull. Inst. Combin. Appl. 27 (1999) 69-80.

175. Strong distance in strong digraphs (with D. Erwin, M. Raines, and P. Zhang) J. Combin. Math. Combin. Comput. 31 (1999) 33-44.

176. Convex sets in graphs (with P. Zhang) Congr. Numer. 136 (1999) 19-32.

177. Which sequences of iterated jump graphs are planar? (with H. Gavlas, D. W. VanderJagt, and P. Zhang) Congr. Numer.139(1999)33-39.

178. On strong distance in strong oriented graphs (with D. Erwin, M. Raines, and P. Zhang) Congr. Numer. 141 (1999)49-63.