Robert C. Brigham

866 total citations
40 papers, 555 citations indexed

About

Robert C. Brigham is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Robert C. Brigham has authored 40 papers receiving a total of 555 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 12 papers in Geometry and Topology and 10 papers in Computer Networks and Communications. Recurrent topics in Robert C. Brigham's work include Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (13 papers) and Graph theory and applications (12 papers). Robert C. Brigham is often cited by papers focused on Advanced Graph Theory Research (25 papers), Graph Labeling and Dimension Problems (13 papers) and Graph theory and applications (12 papers). Robert C. Brigham collaborates with scholars based in United States and South Africa. Robert C. Brigham's co-authors include Ronald D. Dutton, Phyllis Zweig Chinn, Gary Chartrand, Ping Zhang, Stephen T. Hedetniemi, Teresa W. Haynes, F.R. McMorris, Robert Lee, Michael A. Henning and Douglas F. Rall and has published in prestigious journals such as Communications on Pure and Applied Mathematics, Theoretical Computer Science and Linear Algebra and its Applications.

In The Last Decade

Robert C. Brigham

36 papers receiving 489 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Robert C. Brigham United States	14	438	164	109	81	50	40	555
Ronald D. Dutton United States	15	460 1.1×	156 1.0×	127 1.2×	81 1.0×	54 1.1×	45	583
Geňa Hahn Canada	12	324 0.7×	109 0.7×	59 0.5×	189 2.3×	104 2.1×	26	425
Bohdan Zelinka Czechia	15	638 1.5×	241 1.5×	108 1.0×	146 1.8×	70 1.4×	199	829
J. Richard Lundgren United States	11	233 0.5×	79 0.5×	77 0.7×	70 0.9×	58 1.2×	39	312
Ladislav Nebeský Czechia	13	437 1.0×	194 1.2×	110 1.0×	70 0.9×	105 2.1×	78	546
Charles Payan France	10	402 0.9×	108 0.7×	118 1.1×	116 1.4×	88 1.8×	27	481
Renu Laskar United States	15	773 1.8×	191 1.2×	234 2.1×	201 2.5×	161 3.2×	52	932
Iztok Peterin Slovenia	11	359 0.8×	134 0.8×	63 0.6×	123 1.5×	66 1.3×	71	408
András Sebö France	11	593 1.4×	161 1.0×	106 1.0×	119 1.5×	152 3.0×	27	709
Daniel H. Ullman United States	8	255 0.6×	106 0.6×	65 0.6×	172 2.1×	56 1.1×	35	441

Countries citing papers authored by Robert C. Brigham

Since Specialization

Citations

This map shows the geographic impact of Robert C. Brigham's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Robert C. Brigham with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert C. Brigham more than expected).

Fields of papers citing papers by Robert C. Brigham

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Robert C. Brigham. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Robert C. Brigham. The network helps show where Robert C. Brigham may publish in the future.

Co-authorship network of co-authors of Robert C. Brigham

This figure shows the co-authorship network connecting the top 25 collaborators of Robert C. Brigham. A scholar is included among the top collaborators of Robert C. Brigham based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Robert C. Brigham. Robert C. Brigham is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Anderson, Mark, et al.. (2020). On Exponential Domination of Cm × Cn. AKCE International Journal of Graphs and Combinatorics. 341–351. 2 indexed citations

Brigham, Robert C., Ronald D. Dutton, Teresa W. Haynes, & Stephen T. Hedetniemi. (2008). Powerful alliances in graphs. Discrete Mathematics. 309(8). 2140–2147. 21 indexed citations

Brigham, Robert C. & Ronald D. Dutton. (2008). Bounds on Powerful Alliance Numbers.. Ars Combinatoria. 88. 1 indexed citations

Brigham, Robert C., Ronald D. Dutton, & Stephen T. Hedetniemi. (2007). Security in graphs. Discrete Applied Mathematics. 155(13). 1708–1714. 22 indexed citations

Dutton, Ronald D., Robert Lee, & Robert C. Brigham. (2007). Bounds on a graph's security number. Discrete Applied Mathematics. 156(5). 695–704. 19 indexed citations

Brigham, Robert C., Teresa W. Haynes, Michael A. Henning, & Douglas F. Rall. (2005). Bicritical domination. Discrete Mathematics. 305(1-3). 18–32. 20 indexed citations

Miller, Mary M., Robert C. Brigham, & Ronald D. Dutton. (1999). An Equation Involving the Neighborhood (Two-Step) and Line Graphs.. Ars Combinatoria. 52. 3 indexed citations

Brigham, Robert C., et al.. (1996). Two-φ-tolerance competition graphs. Discrete Applied Mathematics. 66(2). 101–108.

Brigham, Robert C., et al.. (1995). Tolerance competition graphs. Linear Algebra and its Applications. 217. 41–52. 36 indexed citations

10.

Dutton, Ronald D., et al.. (1995). Changing and unchanging of the radius of a graph. Linear Algebra and its Applications. 217. 67–82. 5 indexed citations

11.

Haynes, Teresa W., Robert C. Brigham, & Ronald D. Dutton. (1993). Extremal graphs domination insensitive to the removal of k edges. Discrete Applied Mathematics. 44(1-3). 295–304. 2 indexed citations

12.

Brigham, Robert C. & Ronald D. Dutton. (1990). Factor domination in graphs. Discrete Mathematics. 86(1-3). 127–136. 27 indexed citations

13.

Dutton, Ronald D., et al.. (1989). INGRID: A graph invariant manipulator. Journal of Symbolic Computation. 7(2). 163–177. 10 indexed citations

14.

Dutton, Ronald D. & Robert C. Brigham. (1988). An extremal problem for edge domination insensitive graphs. Discrete Applied Mathematics. 20(2). 113–125. 15 indexed citations

15.

Dutton, Ronald D. & Robert C. Brigham. (1986). Computationally Efficient Bounds for the Catalan Numbers. European Journal of Combinatorics. 7(3). 211–213. 12 indexed citations

16.

Brigham, Robert C. & Ronald D. Dutton. (1985). Bounds On Graph Spectra And Girth. Journal of International Crisis and Risk Communication Research. 1 indexed citations

17.

Brigham, Robert C. & Ronald D. Dutton. (1984). Upper bounds on the edge clique cover number of a graph. Discrete Mathematics. 52(1). 31–37. 4 indexed citations

18.

Brigham, Robert C. & Ronald D. Dutton. (1983). On clique covers and independence numbers of graphs. Discrete Mathematics. 44(2). 139–144. 16 indexed citations

19.

Dutton, Ronald D. & Robert C. Brigham. (1983). A characterization of competition graphs. Discrete Applied Mathematics. 6(3). 315–317. 42 indexed citations

20.

Brigham, Robert C. & Ronald D. Dutton. (1981). Graphs which, with their complements, have certain clique covering numbers. Discrete Mathematics. 34(1). 1–7. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact