| Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph. | 0 | 0.34 | 2017 |
| Open-Independent, Open-Locating-Dominating Sets | 0 | 0.34 | 2017 |
| Fault tolerant detectors for distinquishing sets in graphs. | 0 | 0.34 | 2015 |
| On Open Neighborhood Locating- Dominating In Graphs | 1 | 0.38 | 2014 |
| A sharp lower bound for locating-dominating sets in trees | 1 | 0.35 | 2014 |
| Uniqueness of Vertex Magic Constants. | 3 | 1.25 | 2013 |
| Distance independence in graphs. | 0 | 0.34 | 2011 |
| Open neighborhood locating-dominating in trees | 17 | 0.96 | 2011 |
| Open neighborhood locating-domination for infinite cylinders | 2 | 0.39 | 2011 |
| An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin, and Spread. | 1 | 0.60 | 2011 |
| On locating-domination in graphs. | 0 | 0.34 | 2010 |
| Open neighborhood locating dominating sets. | 0 | 0.34 | 2010 |
| Liar's domination in graphs | 7 | 0.66 | 2009 |
| Liar's domination | 5 | 0.67 | 2009 |
| Queen's domination using border squares and (A,B)-restricted domination | 0 | 0.34 | 2008 |
| Roman dominating influence parameters | 3 | 0.51 | 2007 |
| Efficient (j, k)-domination. | 3 | 0.49 | 2007 |
| An introduction to proper-coupled-domination in graphs | 0 | 0.34 | 2006 |
| Competition-reachability of a graph | 0 | 0.34 | 2006 |
| An introduction to competition-reachability of a graph | 1 | 0.40 | 2005 |
| Trees With Equal Domination And Paired-Domination Numbers | 2 | 0.39 | 2005 |
| An Introduction To Maximum Sum Permutations Of Graphs | 0 | 0.34 | 2004 |
| H-domination in graphs | 0 | 0.34 | 2003 |
| Distance and connectivity measures in permutation graphs | 15 | 1.26 | 2003 |
| Strong equality of domination parameters in trees | 6 | 0.96 | 2003 |
| Graphs of order n with locating-chromatic number n - 1 | 8 | 1.33 | 2003 |
| H-forming sets in graphs | 4 | 0.51 | 2003 |
| Fault-tolerant locating-dominating sets | 28 | 2.41 | 2002 |
| Bounds On The Total Redundance And Efficiency Of A Graph | 2 | 0.41 | 1999 |
| Center, median, and centroid subgraphs | 12 | 1.01 | 1999 |
| A survey of sequences of central subgraphs | 3 | 0.42 | 1999 |
| Parity dimension for graphs | 11 | 1.99 | 1998 |
| Closed neighborhood order dominating functions. | 0 | 0.34 | 1998 |
| Paired-domination in graphs | 84 | 8.59 | 1998 |
| Inequalities relating domination parameters in cubic graphs | 35 | 6.44 | 1996 |
| The algorithmic complexity of signed domination in graphs. | 0 | 0.34 | 1995 |
| A recurrence template for several parameters in series-parallel graphs | 5 | 0.64 | 1994 |
| Three-valued k-neighborhood domination in graphs. | 0 | 0.34 | 1994 |
| The optimal unicyclic graphs for pair-connected reliability | 4 | 0.48 | 1993 |
| Efficient edge domination problems in graphs | 22 | 1.58 | 1993 |
| Distinct distance sets in a graph | 2 | 0.89 | 1991 |
| On minimum dominating sets with minimum intersection | 6 | 0.71 | 1990 |
| Convex labelings of trees | 0 | 0.34 | 1987 |
| A note on similar edges and edge-unique line graphs | 0 | 0.34 | 1985 |
| On k-graceful, locally finite graphs | 2 | 0.65 | 1983 |
| Counterexamples to randić's conjecture on distance degree sequences for trees | 9 | 1.71 | 1982 |
| A linear algorithm for the number of degree constrained subforests of a tree | 0 | 0.34 | 1982 |
| Accretion Centers - A Generalization Of Branch Weight Centroids | 6 | 0.82 | 1981 |
| Information Dissemination In Trees | 116 | 18.65 | 1981 |
| On graphs containing a given graph as center. | 19 | 4.63 | 1981 |
