School of Electrical Engineering and Computer Science Faculty

Ronald D. Dutton

Ph.D., Computer Science, Washington State University

Program Director and Graduate Program Coordinator of Computer Science
Joint Appointment with Department of Mathematics

Publications

• Papers in Refereed Journals
• Papers in Refereed Proceedings

Papers in Refereed Journals

1. with M. Massara, W. E. Walden and B. Hudson, TAXIR-A biologically-oriented information retrieval system as an aid to plant introduction , Economic Botany, (Oct.-Nov., 1971).
2. with C. B. Milham, On diversions from the Northwest- normal and high-flow years , Water Resources Bulletin, (April, 1973).
3. with C. B. Milham and G. Hinman, On the optimal location of nuclear power facili ties in the Pacific Northwest, Operations Research, Vol. 22, No. 3 (1974).
   
4. with R. C. Brigham, A new graph coloring algorithm , Computer Journal, 24 (1981), pp. 85-86.
   
5. with R. C. Brigham and J. R. Driscoll, Complexity of a proposed data base storage structure, Information Systems, 6 (1981), pp. 47-52.
   
6. with R. C. Brigham, Graphs which, with their complements, have certain clique cover numbers, Disc. Math., 34 (1981), pp. 1-7.
   
7. with R. C. Brigham, Generalized k-tuple coloring of cycles and other graphs, J. of Comb. Theory(B), 32 (1982), pp. 90-94.
   
8. with R. C. Brigham, The complexity of a multiprocessor task assignment problem without deadlines, Theoretical Comp. Sci., 17 (1982), pp. 213-213.
   
9. with R. C. Brigham, A characterization of Competition graphs , Disc. Appl. Math., 44 (1983), pp. 315-317.
   
10. with R. C. Brigham, On clique covers and independence numbers of graphs , Disc. Math., 44 (1983), pp. 139-144.
    
11. with R. C. Brigham, Efficiently identifying the faces of a solid , Computers and Graphics, 7 (1983), pp. 143-147.
    
12. with R. C. Brigham, Upper bounds on the edge clique cover number of a graph, Disc. Math., 52 (1984), pp. 31-37.
    
13. with R. C. Brigham, Bounds on graph spectra , J. of Comb. Theory(B), Vol. 37, No. 3 (1984), pp. 228-234.
    
14. with R. C. Brigham, A compilation of relations between graph invariants , Networks, Vol. 15 (1985), pp. 73-107.
15. with R. C. Brigham, P. Z. Chinn and F. Harary, Realization of parity visits in walking a graph , College Math. Journal, Vol. 16, No. 4 (1985), pp. 280-282.
    
16. with R. C. Brigham, Computationally efficient bounds for the Catalan numbers , European Journal of Combinatorics, 7 (1986), pp. 211-213.
    
17. with A. P. Shelton and R. C. Brigham, Extension of a clique cover result to uniform hypergraphs, Discrete Mathematics, 59 (1986), pp. 199-201.
    
18. with R. C. Brigham, On neighborhood graphs , Journal on Combinatorics, Information and System Sciences, 12 (1987), pp. 75-85.
    
19. with J. W. Boland and R. C. Brigham, Embedding arbitrary graphs in neighborhood graphs, Journal of Combinatorics and System Sciences, 12 (1987), pp. 101-112.
    
20. with R. C. Brigham and P. Z. Chinn, Vertex domination critical graphs , Networks, 18 (1988), pp. 173-179.
    
21. with R. C. Brigham, An extremal problem for edge domination insensitive graphs , Discrete Applied Mathematics, 20 (1988), pp. 113-125.
    
22. with R. C. Brigham and F. Gomez, INGRID: a graph invariant manipulator, Journal of Symbolic Computation, 7 (1989), pp. 163-177. (Invited)
    
23. with R. C. Brigham, On the size of graphs of a given bandwidth , Discrete Mathematics, 76 (1989), pp. 191-195.
    
24. with R. C. Brigham, Bounds on the domination number of a graph , Oxford Quarterly Journal of Mathematics(2), 41 (1989), pp. 269-275.
    
25. with T. W. Haynes, R. Guha and R. C. Brigham, The G-network and its inherent fault tolerant properties , International J. of Computer Math., 31 (1990), pp. 167-175.
    
26. with R. C. Brigham, Factor domination in graphs , Discrete Mathematics, 86 (1990), pp. 127-136. (Invited) (Also in: Annals of Discrete Mathematics, Ed. R. Lasker and S. Hedetniemi.)
    
27. with R. C. Brigham, A compilation of relations between graph invariants- Supplement I, Networks, 21 (1991), pp. 421-455.
    
28. with R. C. Brigham, F. Harary and T. W. Haynes, Characterization of the caterpillars obtained from a unique animal , Journal of Combinatorics, Information and Systems Science, 15 (1991), pp. 247-255.
    
29. with R. C. Brigham, Edges in graphs with large girth , Graphs and Combinatorics, 7 (1991), pp. 315-321.
30. with R. C. Brigham and N. Chandrasekharan, On the number of independent sets of nodes in a tree, Fibonacci Quarterly, Vol. 31, No. 2 (1991), pp. 98-104.
    
31. with R. C. Brigham and F. R. McMorris, On the relationship between p-edge and p -vertex clique covers, Vishwa International J. of Graph Theory, Vol. 1, No. 2 (1992), pp. 133-140.
    
32. with R. C. Brigham, Node connectivity equals minimum degree in Pascal graphs , ARS Combinatoria,35A (1993), pp. 143-154.
    
33. with R. C. Brigham and T. W. Haynes, Extremal graphs domination insensitive to the removal of k edges, Discrete Applied Mathematics, 44 (1993), pp. 295-304.
    
34. Weak-heap sort, BIT, 33 (1993), pp. 372-381.
    
35. with R. C. Brigham and J. Carrington, Embedding in Steinhaus Graphs , J. of Combinatorics, Information and Systems Science, vol. 17, 1992 (printed in 1994), pp. 257 -70.
    
36. with R. C. Brigham, J. Carrington and F. Harary, Unicyclic graphs derived from square-cell animals , Bull. of Malaysian Math. Society (Second Series) 17 (1994), pp. 75-80.
    
37. with R. C. Brigham and S. Medidi, Changing and unchanging of the radius of a graph, Linear Algebra and Its Applications 217 (1995), pp. 67-82.
    
38. with R. C. Brigham, On the radius and diameter of the clique graph , Discrete Mathematics. (accepted, June 6, 1994)
    
39. with R. C. Brigham, Invarient relations involving the additive bandwidth , J. of Comb. Math and Comb. Computing. (submitted, Sept., 1994)

Conference Papers in Refereed Proceedings

1. with C. B. Milham, Diversions of Northwest Water Computer Assessments , Proceedings of the Sixth Annual Symposium On the Interface Between Statistics and Computing, Berkley, CA, (Oct., 1972).
   
2. with R. C. Brigham, C-graphs are Recognizable and Edge-Reconstructible , Congressus Numerantium, 29 (1980), pp. 377-387. (Proceedings of the Eleventh Southeastern Con ference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, March 3-7, 1980.)
   
3. with R. C. Brigham, INGRID: A Software Tool for Extremal Graph Theory Research , Congressus Numerantium, 39 (1983), pp. 337-352. (Proceedings of the fourteenth South eastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, Feb. 14-17, 1983.)
   
4. with D. Taylor and R. C. Brigham, Bounds on Nordhaus-Gaddum Type Bounds for Clique Cover Numbers, Congressus Numerantium, 40 (1983), pp. 389-398. (Proceedings of the fourteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, Feb. 14-17, 1983.)
   
5. with R. C. Brigham and P. Z. Chinn, On the Clique Graph of the Line Graph , Congressus Numerantium, 43 (1984), pp. 175-190. (Proceedings of the Fifteenth Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, 1984.)
   
6. with R. C. Brigham, Strong, Weak and Other Colorings of Uniform Hypergraphs , Congressus Numerantium, 47 (1985), pp. 299-314. (Proceedings o the Sixteenth Confer ence on Combinatorics, Graph Theory and Computing, Boca Raton, FL, Feb. 11-15, 1985.)
   
7. with R. C. Brigham, Neighborhood Numbers, New Invariants of Undirected Graphs , Congressus Numerantium, 53 ( 1986), pp. 121-132. (Proceedings of the Seventeenth Souteastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 10-14, 1986.)
   
8. with R. C. Brigham, Bounds on Some Graph Invariants as a Function of Girth , Congressus Numerantium, 59 (1987), pp. 13-22. (Proceedings of the Eighteenth South eastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 23-27, 1987.)
9. with J. W. Boland and R. C. Brigham, The Difference between a Neighborhood Graph and a Wheel, Congressus Numerantium, 58 (1987), pp. 151-156. (Proceedings of the Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 23-27, 1987.)
   
10. with R. E. Newman-Wolfe and R. C. Brigham, Connecting Sets in Graphs , Congressus Numerantium, 67 (1988), pp. 67-76. (Proceedings of the Nineteenth Southeastern Inter national Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 15-19, 1988.)
    
11. with T. H. Rice and R. C. Brigham, Extremal 2-2 Insensitive Graphs , Congressus Numerantium, 67 (1988), pp. 158-166. (Proceedings of the Nineteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 15-19, 1988.)
    
12. with R. C. Brigham, Changing and Unchanging Invariants: The Edge Clique Cover Number, Congressus Numerantium, 70 (1990), pp. 145-152. (Proceedings of the Twenti eth Southeastern International Conference on Combinatorics, Graph Theory, and Com puting, Florida Atlantic University, Boca Raton, FL, Feb. 20-24, 1989.)
    
13. with T. W. Haynes, L. M. Lawson and R. C. Brigham, Changing and Unchanging of the Graphical Invariants: Minimum and Maximum Degree, Maximum Clique Size, Node Independence Number and Edge Independence Number , Congressus Numerantium, 72 (1990), pp. 239-252. (Proceedings of the Twentieth, Southeastern International Confer ence on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 20-24, 1989.)
    
14. with R. C. Brigham, Distances and Diameters in Steinhaus Graphs , Congressus Numerantium, 76 (1990), pp. 7-14. (Proceedings of the Twentyfirst Southeastern Interna tional Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 12-16, 1990.)
    
15. with R. C. Brigham, Compatible Committees , Congressus Numerantium, 83 (1991), pp 161-166. (Proceedings of the Twenty second Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, Baton Rouge, LA, Feb. 11-15, 1991.)
    
16. with R. C. Brigham and N. Deo, On Pascal Graphs , Congressus Numerantium 90 (1992), pp. 141-150. (Proceedings of the Twentythird Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 22-26, 1992.)
    
17. with R. C. Brigham, F. R. McMorris and J. B. Mize, On P-edge Clique Covers of Graphs, Congressus Numerantium 93 (1993), pp. 149-157. (Proceedings of the Twentyfourth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, Feb. 22-26, 1993.)
18. with R. C. Brigham and S. Medidi, On Changing and Unchanging Radius , Conference on Graphs and Matrices,University of Colorado, Boulder, CO, May 7-8, 1993. Invited.
    
19. with R. C. Brigham, Nordhaus-Gaddum Results for the p-Vertex Clique Cover Number , Congressus Numerantium 100 (1994), pp. 125-128. (Proceedings of the Twentyfifth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, March 7-11, 1994.)
    
20. with R. C. Brigham, Deleted Subgraph Isomorphism , Congressus Numerantium (1995) (Proceedings of the Twentysixth Southeastern International Conference on Combinato rics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, March 6-10, 1995.)
    
21. with Rodney O. Rogers, Properties of the Rotation Graph of Binary Trees , Congressus Numerantium (1995) (Proceedings of the Twentysixth Southeastern International Confer ence on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, FL, March 6-10, 1995.)