The following pages link to Ronald D. Dutton (Q792342):
Displaying 50 items.
- (Q624144) (redirect page) (← links)
- Rooted secure sets of trees (Q624145) (← links)
- Global secure sets of grid-like graphs (Q628346) (← links)
- Extremal graphs domination insensitive to the removal of \(k\) edges (Q686272) (← links)
- Bounds on graph spectra (Q792343) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Powerful alliances in graphs (Q1025468) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- On a graph's security number (Q1043972) (← links)
- On global domination critical graphs (Q1045134) (← links)
- A characterization of competition graphs (Q1055443) (← links)
- Extension of a clique cover result to uniform hypergraphs (Q1078579) (← links)
- Computationally efficient bounds for the Catalan numbers (Q1097279) (← links)
- An extremal problem for edge domination insensitive graphs (Q1099185) (← links)
- INGRID: A graph invariant manipulator (Q1113914) (← links)
- On the size of graphs of a given bandwidth (Q1121919) (← links)
- Generalized k-tuple colorings of cycles and other graphs (Q1154475) (← links)
- The complexity of a multiprocessor task assignment problem without deadlines (Q1155958) (← links)
- Graphs which, with their complements, have certain clique covering numbers (Q1158174) (← links)
- (Q1180671) (redirect page) (← links)
- Edges in graphs with large girth (Q1180673) (← links)
- Inversions in \(k\)-sorted permutations (Q1270771) (← links)
- Weak-heap sort (Q1314628) (← links)
- Edge-recognizable domination numbers. (Q1415542) (← links)
- Changing and unchanging of the radius of a graph (Q1805308) (← links)
- On clique covers and independence numbers of graphs (Q1839263) (← links)
- On the radius and diameter of the clique graph (Q1910528) (← links)
- Security in graphs (Q2381534) (← links)
- Factor domination in graphs (Q2641315) (← links)
- (Q2744375) (← links)
- (Q2760986) (← links)
- Full domination in graphs (Q2773042) (← links)
- (Q2785713) (← links)
- (Q2839639) (← links)
- Edge dominating sets and vertex covers (Q2860871) (← links)
- (Q2878221) (← links)
- (Q2918573) (← links)
- (Q2940127) (← links)
- (Q2960941) (← links)
- (Q3070314) (← links)
- (Q3113195) (← links)
- (Q3139726) (← links)
- (Q3313890) (← links)
- (Q3318779) (← links)
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH (Q3353049) (← links)
- Global Domination (Q3384618) (← links)
- (Q3423990) (← links)
- (Q3429515) (← links)
- (Q3429552) (← links)
- Resolving domination in graphs (Q4802814) (← links)
