| Unique minimum semipaired dominating sets in trees. | 0 | 0.34 | 2023 |
| Restrained Domination In Self-Complementary Graphs | 0 | 0.34 | 2021 |
| The Upper Domatic Number Of A Graph | 0 | 0.34 | 2020 |
| The Upper Domatic Number Of A Graph | 0 | 0.34 | 2020 |
| Perfect double Roman domination of trees. | 0 | 0.34 | 2020 |
| Introduction To Coalitions In Graphs | 0 | 0.34 | 2020 |
| Cover rubbling and stacking | 0 | 0.34 | 2020 |
| Trees with Unique Minimum Semitotal Dominating Sets | 0 | 0.34 | 2020 |
| Perfect Italian domination in trees. | 0 | 0.34 | 2019 |
| Graphs with large semipared domination number | 0 | 0.34 | 2019 |
| Domination cover rubbling. | 0 | 0.34 | 2019 |
| 1-restricted optimal rubbling on graphs. | 0 | 0.34 | 2019 |
| Perfect graphs involving semitotal and semipaired domination. | 0 | 0.34 | 2018 |
| Domination parameters of a graph and its complement. | 0 | 0.34 | 2018 |
| Client–server and cost effective sets in graphs | 0 | 0.34 | 2018 |
| Rainbow disconnection in graphs. | 1 | 0.39 | 2018 |
| Partitioning the vertices of a cubic graph into two total dominating sets. | 2 | 0.41 | 2017 |
| Restricted optimal pebbling and domination in graphs. | 1 | 0.63 | 2017 |
| Roman domination in complementary prisms. | 0 | 0.34 | 2017 |
| A Roman Domination Chain. | 1 | 0.35 | 2016 |
| Neighborhood-restricted [≤2]-achromatic colorings. | 0 | 0.34 | 2016 |
| A note on non-dominating set partitions in graphs. | 0 | 0.34 | 2016 |
| Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. | 0 | 0.34 | 2015 |
| Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. | 3 | 0.39 | 2015 |
| Bounds on weak roman and 2-rainbow domination numbers. | 8 | 0.98 | 2014 |
| Total Domination in Graphs with Diameter 2. | 7 | 0.70 | 2014 |
| Improved bounds on the domination number of a tree. | 1 | 0.39 | 2014 |
| Downhill domination in graphs. | 1 | 0.43 | 2014 |
| Independent [1, K]-Sets In Graphs | 0 | 0.34 | 2014 |
| A characterization of P5-free, diameter-2-critical graphs. | 2 | 0.36 | 2014 |
| Bounds on the connected domination number of a graph | 6 | 0.53 | 2013 |
| Relating the annihilation number and the total domination number of a tree | 6 | 0.53 | 2013 |
| [1, 2]-sets in graphs | 7 | 0.88 | 2013 |
| Edge lifting and total domination in graphs | 0 | 0.34 | 2013 |
| Erratum to \"Total domination supercritical graphs with respect to relative complements\" [Discrete Math. 258 (2002) 361-371] | 0 | 0.34 | 2012 |
| A characterization of diameter-2-critical graphs whose complements are diamond-free | 4 | 0.38 | 2012 |
| On the existence of k-partite or Kp-free total domination edge-critical graphs | 5 | 0.55 | 2011 |
| Maximal independent sets in minimum colorings | 3 | 0.54 | 2011 |
| Total domination changing and stable graphs upon vertex removal | 4 | 0.42 | 2011 |
| On a conjecture of Murty and Simon on diameter 2-critical graphs | 3 | 0.43 | 2011 |
| Total domination dot-stable graphs | 0 | 0.34 | 2011 |
| A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free | 5 | 0.52 | 2011 |
| Double Domination Stable Graphs Upon Edge Removal | 0 | 0.34 | 2010 |
| k-Domination stable graphs upon edge removal | 1 | 0.36 | 2010 |
| Total domination critical and stable graphs upon edge removal | 6 | 0.53 | 2010 |
| Total domination stable graphs upon edge addition | 4 | 0.41 | 2010 |
| A predictive model for secondary RNA structure using graph theory and a neural network. | 13 | 0.42 | 2010 |
| Upper Bounds on the Total Domination Number. | 4 | 0.46 | 2009 |
| A survey of stratified domination in graphs | 1 | 0.38 | 2009 |
| Global Offensive Alliance Numbers In Graphs With Emphasis On Trees | 0 | 0.34 | 2009 |
