2025
Bounds on the <i>k</i>-conversion number.
Discuss. Math. Graph Theory, 2025
2024
Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set.
Australas. J Comb., June, 2024
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set.
Discret. Appl. Math., 2024
2023
Coalition graphs of paths, cycles, and trees.
Discuss. Math. Graph Theory, 2023
Unique minimum semipaired dominating sets in trees.
Discuss. Math. Graph Theory, 2023
2021
Bounds on the semipaired domination number of graphs with minimum degree at least two.
J. Comb. Optim., 2021
Restrained domination in self-complementary graphs.
Discuss. Math. Graph Theory, 2021
2020
Trees with Unique Minimum Semitotal Dominating Sets.
Graphs Comb., 2020
Cover rubbling and stacking.
Discret. Math., 2020
Perfect double Roman domination of trees.
Discret. Appl. Math., 2020
Total domination cover rubbling.
Discret. Appl. Math., 2020
The upper domatic number of a graph.
AKCE Int. J. Graphs Comb., 2020
Introduction to coalitions in graphs.
AKCE Int. J. Graphs Comb., 2020
2019
Graphs with large semipared domination number.
Discuss. Math. Graph Theory, 2019
1-restricted optimal rubbling on graphs.
Discuss. Math. Graph Theory, 2019
Perfect Italian domination in trees.
Discret. Appl. Math., 2019
Domination cover rubbling.
Discret. Appl. Math., 2019
2018
Perfect graphs involving semitotal and semipaired domination.
J. Comb. Optim., 2018
Domination parameters of a graph and its complement.
Discuss. Math. Graph Theory, 2018
Rainbow disconnection in graphs.
Discuss. Math. Graph Theory, 2018
Distribution centers in graphs.
Discret. Appl. Math., 2018
Client-server and cost effective sets in graphs.
AKCE Int. J. Graphs Comb., 2018
2017
On ve-degrees and ev-degrees in graphs.
Discret. Math., 2017
Partitioning the vertices of a cubic graph into two total dominating sets.
Discret. Appl. Math., 2017
Restricted optimal pebbling and domination in graphs.
Discret. Appl. Math., 2017
Roman domination in complementary prisms.
Australas. J Comb., 2017
2016
A Roman Domination Chain.
Graphs Comb., 2016
A note on non-dominating set partitions in graphs.
Discuss. Math. Graph Theory, 2016
Discret. Appl. Math., 2016
Neighborhood-restricted [≤2]-achromatic colorings.
Discret. Appl. Math., 2016
Discret. Appl. Math., 2016
2015
Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey.
J. Comb. Optim., 2015
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs.
Graphs Comb., 2015
Very cost effective bipartitions in graphs.
AKCE Int. J. Graphs Comb., 2015
2014
Total Domination in Graphs with Diameter 2.
J. Graph Theory, 2014
Downhill domination in graphs.
Discuss. Math. Graph Theory, 2014
A characterization of P<sub>5</sub>-free, diameter-2-critical graphs.
Discret. Appl. Math., 2014
Improved bounds on the domination number of a tree.
Discret. Appl. Math., 2014
Bounds on weak roman and 2-rainbow domination numbers.
Discret. Appl. Math., 2014
Independent [1, k]-sets in graphs.
Australas. J Comb., 2014
2013
Edge lifting and total domination in graphs.
J. Comb. Optim., 2013
Bounds on the connected domination number of a graph.
Discret. Appl. Math., 2013
Relating the annihilation number and the total domination number of a tree.
Discret. Appl. Math., 2013
Discret. Appl. Math., 2013
2012
On a conjecture of Murty and Simon on diameter two critical graphs II.
Discret. Math., 2012
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371].
Discret. Math., 2012
A characterization of diameter-2-critical graphs whose complements are diamond-free.
Discret. Appl. Math., 2012
2011
On a conjecture of Murty and Simon on diameter 2-critical graphs.
Discret. Math., 2011
On the existence of k-partite or K<sub>p</sub>-free total domination edge-critical graphs.
Discret. Math., 2011
Maximal independent sets in minimum colorings.
Discret. Math., 2011
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free.
Discret. Optim., 2011
Total domination dot-stable graphs.
Discret. Appl. Math., 2011
Total domination changing and stable graphs upon vertex removal.
Discret. Appl. Math., 2011
An extremal problem for total domination stable graphs upon edge removal.
Discret. Appl. Math., 2011
2010
<i>k</i>-independence stable graphs upon edge removal.
Discuss. Math. Graph Theory, 2010
Total domination stable graphs upon edge addition.
Discret. Math., 2010
Total domination critical and stable graphs upon edge removal.
Discret. Appl. Math., 2010
A predictive model for secondary RNA structure using graph theory and a neural network.
BMC Bioinform., 2010
Double domination stable graphs upon edge removal.
Australas. J Comb., 2010
2009
Domination and total domination in complementary prisms.
J. Comb. Optim., 2009
Bounds on the global offensive <i>k</i>-alliance number in graphs.
Discuss. Math. Graph Theory, 2009
A survey of stratified domination in graphs.
Discret. Math., 2009
A dedication to Professor Gary Chartrand.
Discret. Math., 2009
Powerful alliances in graphs.
Discret. Math., 2009
Upper Bounds on the Total Domination Number.
Ars Comb., 2009
Global offensive alliance numbers in graphs with emphasis on trees.
Australas. J Comb., 2009
2008
Ratios of some domination parameters in trees.
Discret. Math., 2008
2007
Global Alliances and Independence in Trees.
Discuss. Math. Graph Theory, 2007
2006
Characterizations of trees with equal paired and double domination numbers.
Discret. Math., 2006
Locating and total dominating sets in trees.
Discret. Appl. Math., 2006
Discret. Appl. Math., 2006
A quantitative analysis of secondary RNA structure using domination based parameters on trees.
BMC Bioinform., 2006
Private Domination Trees.
Ars Comb., 2006
Placing monitoring devices in electric power networks modelled by block graphs.
Ars Comb., 2006
2005
Trees with two disjoint minimum independent dominating sets.
Discret. Math., 2005
Trees with Equal Domination and Paired-domination Numbers.
Ars Comb., 2005
2004
Total domination subdivision numbers of graphs.
Discuss. Math. Graph Theory, 2004
Hereditary domination and independence parameters .
Discuss. Math. Graph Theory, 2004
Total domination subdivision numbers of trees.
Discret. Math., 2004
The diameter of total domination vertex critical graphs.
Discret. Math., 2004
Trees with Unique Minimum Paired-Dominating Sets.
Ars Comb., 2004
Detour Domination in Graphs.
Ars Comb., 2004
2003
Strong equality of domination parameters in trees.
Discret. Math., 2003
<i>H</i>-forming sets in graphs.
Discret. Math., 2003
Changing and unchanging domination: a classification.
Discret. Math., 2003
Stratification and domination in graphs.
Discret. Math., 2003
Global Defensive Alliances in Graphs.
Electron. J. Comb., 2003
Total Domination Edge Critical Graphs with Minimum Diameter.
Ars Comb., 2003
Proceedings of the Handbook of Graph Theory., 2003
2002
Domination in Graphs Applied to Electric Power Networks.
SIAM J. Discret. Math., 2002
Trees with unique minimum total dominating sets.
Discuss. Math. Graph Theory, 2002
Total domination supercritical graphs with respect to relative complements.
Discret. Math., 2002
Trees with equal domination and tree-free domination numbers.
Discret. Math., 2002
A characterization of <i>i</i>-excellent trees.
Discret. Math., 2002
Total irredundance in graphs.
Discret. Math., 2002
Total domination critical graphs with respect to relative complements.
Ars Comb., 2002
Total domination good vertices in graphs.
Australas. J Comb., 2002
2001
Total Domination Edge Critical Graphs with Maximum Diameter.
Discuss. Math. Graph Theory, 2001
Domination Subdivision Numbers.
Discuss. Math. Graph Theory, 2001
Domination and total domination critical trees with respect to relative complements.
Ars Comb., 2001
Stable and unstable graphs with total irredundance number zero.
Ars Comb., 2001
2000
Domination and independence subdivision numbers of graphs.
Discuss. Math. Graph Theory, 2000
Extremal graphs for inequalities involving domination parameters.
Discret. Math., 2000
Induced-Paired Domination in Graphs.
Ars Comb., 2000
The domatic numbers of factors of graphs.
Ars Comb., 2000
Double Domination in Graphs.
Ars Comb., 2000
A characterization of domination 4-relative-critical graphs of diameter 5.
Australas. J Comb., 2000
1999
On perfect neighborhood sets in graphs.
Discret. Math., 1999
1998
Paired-domination in graphs.
Networks, 1998
Domination critical graphs with respect to relative complements.
Australas. J Comb., 1998
Fundamentals of domination in graphs.
Pure and applied mathematics 208, Dekker, ISBN: 978-0-8247-0033-1, 1998
1996
Nordhaus-Gaddum inequalities for domination in graphs.
Discret. Math., 1996
1995
Int. J. Comput. Math., 1995
1993
Applications of E-graphs in network design.
Networks, 1993
Extremal Graphs Domination Insensitive to the Removal of <i>k</i> Edges.
Discret. Appl. Math., 1993
