| Year |
Citation |
Score |
| 2014 |
Anderson M, Carrington JR, Brigham RC, Dutton RD, Vitray RP. Graphs simultaneously achieving three vertex cover numbers Journal of Combinatorial Mathematics and Combinatorial Computing. 91: 275-290. |
0.51 |
|
| 2013 |
Dutton RD, Klostermeyer WF. Edge Dominating Sets and Vertex Covers Discussiones Mathematicae Graph Theory. 33: 437-456. DOI: 10.7151/Dmgt.1681 |
0.604 |
|
| 2011 |
Ho YY, Dutton R. Global secure sets of grid-like graphs Discrete Applied Mathematics. 159: 490-496. DOI: 10.1016/J.Dam.2010.12.013 |
0.542 |
|
| 2011 |
Dutton RD. Global domination and packing numbers Ars Combinatoria. 101: 489-501. |
0.729 |
|
| 2009 |
Dutton RD. On a graph's security number Discrete Mathematics. 309: 4443-4447. DOI: 10.1016/J.Disc.2009.02.005 |
0.572 |
|
| 2009 |
Shafique K, Dutton RD. Partitioning a graph into alliance free sets Discrete Mathematics. 309: 3102-3105. DOI: 10.1016/J.Disc.2008.08.011 |
0.656 |
|
| 2009 |
Dutton RD, Brigham RC. On global domination critical graphs Discrete Mathematics. 309: 5894-5897. DOI: 10.1016/J.Disc.2008.06.005 |
0.742 |
|
| 2009 |
Brigham RC, Dutton RD, Haynes TW, Hedetniemi ST. Powerful alliances in graphs Discrete Mathematics. 309: 2140-2147. DOI: 10.1016/J.Disc.2006.10.026 |
0.469 |
|
| 2008 |
Dutton RD, Lee R, Brigham RC. Bounds on a graph's security number Discrete Applied Mathematics. 156: 695-704. DOI: 10.1016/J.Dam.2007.08.037 |
0.527 |
|
| 2008 |
Enciso RI, Dutton RD. Global domination in planar graphs Journal of Combinatorial Mathematics and Combinatorial Computing. 66: 273-278. |
0.408 |
|
| 2007 |
Brigham RC, Dutton RD, Hedetniemi ST. Security in graphs Discrete Applied Mathematics. 155: 1708-1714. DOI: 10.1016/J.Dam.2007.03.009 |
0.444 |
|
| 2005 |
Brigham RC, Chartrand G, Dutton RD, Zhang P. On the dimension of trees Discrete Mathematics. 294: 279-283. DOI: 10.1016/J.Disc.2004.11.013 |
0.372 |
|
| 2005 |
Brigham RC, Chartrand G, Dutton RD, Zhang P. On induced subdigraphs of certain distance-defined digraphs Utilitas Mathematica. 68: 239-253. |
0.646 |
|
| 2003 |
Dutton RD, Brigham RC, Gui C. Edge-recognizable domination numbers Discrete Mathematics. 272: 47-51. DOI: 10.1016/S0012-365X(03)00183-3 |
0.668 |
|
| 2001 |
Brigham RC, Chartrand G, Dutton RD, Zhang P. Full domination in graphs Discussiones Mathematicae Graph Theory. 21: 43-62. DOI: 10.7151/Dmgt.1132 |
0.622 |
|
| 2000 |
Brigham RC, Carrington JR, Dutton RD, Fiedler J, Vitray RP. An extremal bandwidth problem for bipartite graphs Journal of Graph Theory. 35: 278-289. DOI: 10.1002/1097-0118(200012)35:4<>1.0.Co;2-X |
0.439 |
|
| 1999 |
Miller MM, Brigham RC, Dutton RD. An equation involving the neighborhood (two-step) and line graphs Ars Combinatoria. 52: 33-50. |
0.658 |
|
| 1996 |
Brigham RC, Dutton RD, Harary F, Haynes TW. On graphs having equal domination and codomination numbers Utilitas Mathematica. 50: 53-64. |
0.742 |
|
| 1995 |
Dutton RD, Medidi SR, Brigham RC. Changing and unchanging of the radius of a graph Linear Algebra and Its Applications. 217: 67-82. DOI: 10.1016/0024-3795(94)00153-5 |
0.656 |
|
| 1995 |
Dutton RD, Brigham RC. On the radius and diameter of the clique graph Discrete Mathematics. 147: 293-295. DOI: 10.1016/0012-365X(94)00277-P |
0.739 |
|
| 1993 |
Haynes TW, Brigham RC, Dutton RD. Extremal graphs domination insensitive to the removal of k edges Discrete Applied Mathematics. 44: 295-304. DOI: 10.1016/0166-218X(93)90238-J |
0.606 |
|
| 1991 |
Brigham RC, Dutton RD. Factor Domination in Graphs Annals of Discrete Mathematics. 48: 127-136. DOI: 10.1016/0012-365X(90)90355-L |
0.62 |
|
| 1991 |
Dutton RD, Brigham RC. Edges in graphs with large girth Graphs and Combinatorics. 7: 315-321. DOI: 10.1007/Bf01787638 |
0.681 |
|
| 1991 |
Brigham RC, Dutton RD. A compilation of relations between graph invariants—supplement I Networks. 21: 421-455. DOI: 10.1002/Net.3230210405 |
0.591 |
|
| 1990 |
Brigham RC, Dutton RD. Bounds on the domination number of a graph Quarterly Journal of Mathematics. 41: 269-275. DOI: 10.1093/Qmath/41.3.269 |
0.612 |
|
| 1990 |
Haynes T, Guha RK, Brigham RC, Dutton RD. The G-network and its inherent fault tolerant properties International Journal of Computer Mathematics. 31: 167-175. DOI: 10.1080/00207169008803799 |
0.388 |
|
| 1989 |
Dutton RD, Brigham RC, Gomez F. INGRID: A graph invariant manipulator Journal of Symbolic Computation. 7: 163-177. DOI: 10.1016/S0747-7171(89)80048-3 |
0.494 |
|
| 1989 |
Dutton RD, Brigham RC. On the size of graphs of a given bandwidth Discrete Mathematics. 76: 191-195. DOI: 10.1016/0012-365X(89)90319-1 |
0.572 |
|
| 1988 |
Dutton RD, Brigham RC. An extremal problem for edge domination insensitive graphs Discrete Applied Mathematics. 20: 113-125. DOI: 10.1016/0166-218X(88)90058-3 |
0.617 |
|
| 1988 |
Brigham RC, Chinn PZ, Dutton RD. Vertex domination-critical graphs Networks. 18: 173-179. DOI: 10.1002/Net.3230180304 |
0.745 |
|
| 1986 |
Patricia Shelton A, Dutton RD, Brigham RC. Extension of a clique cover result to uniform hypergraphs Discrete Mathematics. 59: 199-201. DOI: 10.1016/0012-365X(86)90081-6 |
0.328 |
|
| 1985 |
Brigham RC, Dutton RD, Chinn PZ, Harary F. Realization of Parity Visits in Walking a Graph College Mathematics Journal. 16: 280-282. DOI: 10.1080/07468342.1985.11972897 |
0.591 |
|
| 1985 |
Brigham RC, Dutton RD. A compilation of relations between graph invariants Networks. 15: 73-107. DOI: 10.1002/Net.3230150108 |
0.589 |
|
| 1984 |
Brigham RC, Dutton RD. Bounds on graph spectra Journal of Combinatorial Theory, Series B. 37: 228-234. DOI: 10.1016/0095-8956(84)90055-8 |
0.596 |
|
| 1984 |
Brigham RC, Dutton RD. Upper bounds on the edge clique cover number of a graph Discrete Mathematics. 52: 31-37. DOI: 10.1016/0012-365X(84)90101-8 |
0.608 |
|
| 1983 |
Dutton RD, Brigham RC. A characterization of competition graphs Discrete Applied Mathematics. 6: 315-317. DOI: 10.1016/0166-218X(83)90085-9 |
0.614 |
|
| 1983 |
Brigham RC, Dutton RD. On clique covers and independence numbers of graphs Discrete Mathematics. 44: 139-144. DOI: 10.1016/0012-365X(83)90054-7 |
0.73 |
|
| 1982 |
Brigham RC, Dutton RD. Generalized k-tuple colorings of cycles and other graphs Journal of Combinatorial Theory, Series B. 32: 90-94. DOI: 10.1016/0095-8956(82)90079-X |
0.545 |
|
| 1981 |
Dutton RD, Brigham RC. A new graph colouring algorithm The Computer Journal. 24: 85-86. DOI: 10.1093/Comjnl/24.1.85 |
0.485 |
|
| 1981 |
Brigham RC, Dutton RD, Driscoll JR. Complexity of a proposed database storage structure Information Systems. 6: 47-52. DOI: 10.1016/0306-4379(81)90017-X |
0.559 |
|
| 1981 |
Brigham RC, Dutton RD. Graphs which, with their complements, have certain clique covering numbers Discrete Mathematics. 34: 1-7. DOI: 10.1016/0012-365X(81)90016-9 |
0.768 |
|
| 1981 |
Dutton RD, Brigham RC. NEW GRAPH COLOURING ALGORITHM Computer Journal. 24: 85-86. |
0.411 |
|
| Show low-probability matches. |