1) L. W. Hudson, R. D. Dutton, Mary Massara Reynolds,
and W. E. Walden, *TAXIR-A
biologically-oriented information retrieval system as an aid to plant
introduction*, Economic Botany, Vol. 25, No. 4 (1971), pp 401-406.

2)
R. D. Dutton and C. B. Millham, *On
diversions from the Northwest- normal and high-flow years*, Water Resources
Bulletin, Vol. 2 (1973), pp. 231-242.

3)
Ron Dutton, George Hinman, and C. B. Millham,
*On the optimal location of nuclear power
facilities in the Pacific Northwest,* Operations Research, Vol. 22, No. 3
(1974), pp. 478-487.

4)
R. D. Dutton and R. C. Brigham, *A
new graph coloring algorithm*, Computer Journal, 24 (1981), pp. 85-86.

5)
R. C. Brigham, R. D. Dutton, and J. R. Driscoll,
*Complexity of a proposed data base storage structure*, Information
Systems, 6 (1981), pp. 47-52.

6)
Robert C. Brigham and Ronald D. Dutton,
*Graphs which, with their complements, have
certain clique cover numbers*, Disc. Math., 34 (1981), pp. 1-7.

7)
R. C. Brigham and R. D. Dutton, *
Generalized k-tuple coloring of cycles and other graphs,* J. of Comb.
Theory(B), 32 (1982), pp. 90-94.

8)
Ronald D. Dutton and Robert C. Brigham,
*The complexity of a multiprocessor task
assignment problem without deadlines,* Theoretical Comp. Sci., 17 (1982), pp.
213-213.

9)
R. D. Dutton and R. C. Brigham, *A
characterization of Competition graphs*, Disc. Appl. Math., 44 (1983), pp.
315-317.

10) Robert C. Brigham and Ronald D. Dutton,
*On clique covers and independence numbers of graphs*, Disc. Math., 44
(1983), pp. 139-144.

11) Ronald D. Dutton and Robert C. Brigham,
*Efficiently identifying the faces of a solid*, Computers and
Graphics, 7 (1983), pp. 143-147.

12) Robert C. Brigham and Ronald D. Dutton,
*Upper bounds on the edge clique cover number of a graph,* Disc.
Math., 52 (1984), pp. 31-37.

13) R. C. Brigham and R. D. Dutton,
*Bounds on graph spectra*, J. of Comb.
Theory(B), Vol. 37, No. 3 (1984), pp. 228-234.

14) Robert C. Brigham and Ronald D. Dutton,
*A compilation of relations between graph invariants*, Networks, Vol.
15 (1985), pp. 73-107.

15) Robert C. Brigham, Ronald D. Dutton, Phyllis Z. Chinn, and
Frank Harary, *Realization of parity visits
in walking a graph*, College Math. Journal, Vol. 16, No. 4 (1985), pp.
280-282.

16) R. C. Brigham and R. D. Dutton,
*Bounds on graph spectra and girth*, ARS
Combinatoria 20 (1985), pp. 91-100.

17) Ronald D. Dutton and Robert C. Brigham,
*Computationally efficient bounds for the Catalan numbers*, European
J. of Combinatorics, 7 (1986), pp. 211-213.

18) A. Patricia Shelton, Ronald D. Dutton, and Robert C. Brigham,
*Extension of a clique cover result to
uniform hypergraphs*, Disc. Math., 59 (1986), pp. 199-201.

19) Robert C. Brigham and Ronald D. Dutton,
*On neighborhood graphs*, J. of Combinatorics, Information and System
Sciences, 12 (1987), pp. 75-85.

20) James W. Boland, Robert C. Brigham, and Ronald D. Dutton,
*Embedding arbitrary graphs in neighborhood
graphs*, J. of Combinatorics, Information and System Sciences, 12 (1987), pp.
101-112.

21) Robert C. Brigham, Phyllis Z. Chinn, and Ronald D. Dutton,
*Vertex domination critical graphs*,
Networks, 18 (1988), pp. 173-179.

22) Ronald D. Dutton and Robert C. Brigham,
*An extremal problem for edge domination insensitive graphs*, Disc.
Appl. Math., 20 (1988), pp. 113-125.

23) Ronald D. Dutton, Robert C. Brigham, and Fernando Gomez,
*INGRID: a graph invariant manipulator,*
J. of Symbolic Computation, 7 (1989), pp. 163-177 (Invited).

24) Ronald D. Dutton and Robert C. Brigham,
*On the size of graphs of a given bandwidth*, Disc. Math., 76 (1989),
pp. 191-195.

25) Robert C. Brigham and Ronald D. Dutton,
*Bounds on the domination number of a graph*, Oxford Quarterly J. of
Math. (2), 41 (1989), pp. 269-275.

26) Teresa Haynes, Ratan K. Guha, Ronald D. Dutton, and Robert C.
Brigham, *The G-network and its inherent
fault tolerant properties*, International J. of Computer Math., 31 (1990),
pp. 167-175.

27) Robert C. Brigham and Ronald D. Dutton,
*Factor domination in graphs*, Discrete Mathematics, 86 (1990), pp.
127-136 (Invited). Also in *Topics on
Domination* (S. T. Hedetniemi and R. C. Laskar, Eds.),
*Annals of Discrete
Mathematics*, Volume 48, Elsevier, 1990.

28) R. C. Brigham, R. D. Dutton, F. Harary, and T. Haynes,
*Characterization of the caterpillars
obtained from a unique animal*, J. of Combinatorics, Information and Systems
Science, 15 (1990), pp. 247-255.

29) Robert C. Brigham and Ronald D. Dutton,
*A compilation of relations between graph invariants- Supplement I*,
Networks, 21 (1991), pp. 421-455.

30) R. D. Dutton and R. C. Brigham,
*Edges in graphs with large girth*,
Graphs and Combinatorics, 7 (1991), pp. 315-321.

31) Robert C. Brigham, Ronald D. Dutton, 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) Robert C. Brigham, Julie R. Carrington, and Ronald D. Dutton,
*Embedding in Steinhaus Graphs*, J. of
Combinatorics, Information and Systems Science, Vol. 17 (1992), pp. 257-70.

33) R. Dutton, N. Chandrasekharan, and R. Brigham,
*On the number of independent sets of nodes in a tree*, Fibonacci
Quarterly, Vol. 31, No. 2 (1993), pp. 98-104.

34) Robert C. Brigham and Ronald D. Dutton,
*Node connectivity equals minimum degree in Pascal graphs*, ARS
Combinatoria, 35A (1993), pp. 143-154.

35) Teresa W. Haynes, Robert C. Brigham, and Ronald D. Dutton,
*Extremal graphs domination insensitive to
the removal of k edges*, Discrete Applied Mathematics, 44 (1993), pp.
295-304.

36) Ronald D. Dutton,*Weak-heap
sort*, BIT, 33 (1993), pp. 372-381.

37) Robert C. Brigham, Ronald D. Dutton, Julie R. Carrington, and
Frank Harary, *Unicyclic graphs derived
from square-cell animals*, Bull. of Malaysian Math. Society (Second Series),
17 (1994), pp. 75-80.

38) Ronald D. Dutton, Sirisha R. Medidi, and Robert C. Brigham,
*Changing and unchanging of the radius of a
graph*, Linear Algebra and Its Applications, 217 (1995), pp. 67-82.

39) Ronald D. Dutton and Robert C. Brigham,
*On the radius and diameter of the clique graph*, Disc. Math., 147
(1995), pp. 293-295.

40) Robert C. Brigham, Ronald D. Dutton, Frank Harary, and Teresa
W. Haynes, *On graphs having equal
domination and codomination numbers*, Utilitas Mathematica, 50 (1996), pp.
53-64.

41) Ronald D. Dutton and Robert C. Brigham,
*Invariant relations involving the additive bandwidth*, J. of Comb.
Math and Comb. Computing 23 (1997), pp. 77-85.

42) Robert C. Brigham and Ronald D. Dutton,
*Pairs of maximal “almost” disjoint isomorphic subgraphs of Spiders*,
Utilitas Mathematica, 52 (1997), pp. 161-172

43) Ronald D. Dutton, *
Inversions in k-sorted Permutations*,
Discrete Applied Mathematics, 87 (1998), pp. 49-56

44) W. Klostermeyer and R. D. Dutton,
*A faster algorithm for least deviant path*, J. Comb. Math. & Comb.
Comput., 29 (1999), pp. 33-40.

45) Mary M. Miller, Robert C. Brigham, and Ronald D. Dutton,
*An equation involving the
neighborhood(two-step) and line graphs*, ARS Combinitorica 52, 33-51, Sept.
1999

46) R. D. Dutton and R. C. Brigham,
*A note on relations between a graph and is
line graph which involve domination concepts*, J. Comb. Math. & Comb.
Computing, 31, 161-168, Oct. 1999.

47) R. C Brigham, J Carrington, R. D. Dutton, J. Fiedler, and R.
Vitray, *An extremal bandwidth problem for
bipartite graphs,* Jour. of Graph Theory, Vol 35, no. 4 (Dec. 2000), pp
278-289.

48) R. D. Dutton and R. C. Brigham,
*On tree partitions*, J. Comb. Math. &
Comb. Computing, 37 (2001), pp 53-63.

49) R. C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang,
*Full domination in graphs,*
Discussiones Mathematicae Graph Theory 21 (2001), pp. 43-62.

50) R. C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang,
*Resolving domination in graphs*,
Mathematica Bohemica 128 (2003) pp. 25-36.

51) R. D. Dutton and R.C. Brigham,
*Partitioning of trees having maximum
degree at most three*, Journal of Combinatorial Mathematics and Combinatorial
Computing 45 (2003), pp. 79-93.

52) R. D. Dutton, R.C. Brigham, and C. Gui,
*Edge–recognizable domination numbers*, Disc. Math, Vol. 272, No. 1
(2003), pp 47-52.

53) R. C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang,
*Forcing full domination in graphs,*
Journal of Combinatorial Mathematics and Combinatorial Computing 49 (2004), pp.
97-111.

54) Robert C. Brigham, Gary Chartrand, R. D. Dutton, and Ping
Zhang, *On induced subdigraphs of certain
distance-defined digraphs,* Utilitas Mathematica 68(2005), pp. 239-253.

55) R.C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang,
*On the dimension of trees,* Discrete
Mathematics, 294 (2005), no. 3, p. 279-283.

56) Khurram H. Shafique and Ronald D. Dutton,
*A tight bound on the cardinalities of maximum alliance-free and minimum
alliance-cover sets*, J. of Combinatorial Mathematics and Combinatorial
Computing 56 (2006), pp. 139-145.

57) A. Cami, H. Balakrishnan, N. Deo, and R. Dutton,
*On the complexity of some global alliance
problems*, J. Comb. Math. & Comb. Computing, 58 (2006), pp. 23-31.

58) Robert C. Brigham, Ronald D. Dutton, and Stephen T. Hedetniemi,
*Security in graphs*, Discrete Applied Mathematics, 155 (2007), no.
13, pp. 1708-1714.

59) R. D. Dutton, R. Lee, and R. C. Brigham,
*Bounds on a graph's security number*,
Discrete Applied Mathematics 156 (2008), no. 5, pp. 695-704.

60) Robert C. Brigham and Ronald D. Dutton,
*Bounds on powerful alliance numbers*,
ARS Combinatoria, 88 (2008), pp 135-159.

61) Rosa I. Enciso and Ronald D. Dutton, *
Global domination in planar graphs*, JMCC, Vol. 66 Aug. (2008), pp. 273-278.

62) Ronald D. Dutton and Robert C.
Brigham, *On global domination critical graphs*, Discrete Mathematics, 309
(2009), pp. 5894-5897

63) Ronald D. Dutton, *On a graph's
security number*, Discrete Mathematics, Vol. 309, Issue 13 (2009), pp.
4443-4447.

64) Ho, Yui Yu and Ronald Dutton,* Rooted
secure sets of trees*, AKCE J. Graphs Combin, 6, No. 3 (2009), pp. 373-392.

65) Khurram H. Shafique and Ronald D. Dutton,
*Partitioning a graph into alliance free sets*, Discrete Mathematics,
Vol. 309, Issue 10 (2009) pp. 3102-3105.

66) Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, and Stephen T.
Hedetniemi, *Powerful alliances in graphs,*
Discrete Math.,Vol. 309, Issue 8 (2009), pp. 2140-2147.

67) Ronald D. Dutton, *Global domination
and Packing numbers*, Ars Combinatoria, (submitted March 30, 2007, accepted
June, 2007, scheduled for print in July, 2011).