Name
Papers
Collaborators
ROBERT C. BRIGHAM
32
21
Citations 
PageRank 
Referers 
157
26.74
219
Referees 
References 
99
74
Search Limit
100219
Title
Citations
PageRank
Year
A new graph coloring scheme.00.342019
Color Stable Graphs.00.342017
On global domination critical graphs00.342009
Powerful alliances in graphs80.812009
Bounds On Powerful Alliance Numbers10.352008
Bounds on a graph's security number131.002008
Security in graphs121.402007
On the dimension of trees10.432005
Bicritical domination40.532005
Extremal connected graphs for independent domination number10.362004
Change In Additive Bandwidth When An Edge Is Added00.342003
Edge-recognizable domination numbers00.342003
Full domination in graphs.00.342001
Domination Sequences00.342000
An extremal bandwidth problem for bipartite graphs00.342000
Bipartite Graphs And Absolute Difference Tolerances00.341999
An Equation Involving The Neighborhood (Two-Step) And Line Graphs30.581999
Two-Phi-Tolerance Competition Graphs00.341996
On the radius and diameter of the clique graph20.501995
Extremal graphs domination insensitive to the removal of k edges00.341993
A Compilation Of Relations Between Graph Invariants - Supplement-160.871991
Factor domination in graphs101.291990
INGRID: A graph invariant manipulator30.681989
Vertex Domination Critical Graphs283.371988
An external problem for edge domination insensitive graphs81.071988
A Compilation Of Relations Between Graph Invariants111.621985
Upper-Bounds On The Edge Clique Cover Number Of A Graph20.661984
On clique covers and independence numbers of graphs122.541983
Efficiently identifying the faces of a solid90.831983
The Complexity Of A Multiprocessor Task Assignment Problem Without Deadlines00.341982
Graphs which, with their complements, have certain clique covering numbers91.951981
A New Graph-Coloring Algorithm141.841981