2025
Signed total Roman domination and domatic numbers in graphs.
Appl. Math. Comput., 2025
2024
New bounds on the outer-independent total double Roman domination number.
Discret. Math. Algorithms Appl., May, 2024
Outer independent total double Italian domination number.
Comput. Sci. J. Moldova, 2024
2023
Double Roman and double Italian domination.
Discuss. Math. Graph Theory, 2023
Total Italian domatic number of graphs.
Comput. Sci. J. Moldova, 2023
2022
Nordhaus-Gaddum type inequalities on the total Italian domination number in graphs.
RAIRO Oper. Res., 2022
Restrained double Roman domination of a graph.
RAIRO Oper. Res., 2022
The Roman domatic problem in graphs and digraphs: a survey.
Discuss. Math. Graph Theory, 2022
Restrained Roman and restrained Italian domatic numbers of graphs.
Discret. Appl. Math., 2022
2021
Nordhaus-Gaddum type results for connected and total domination.
RAIRO Oper. Res., 2021
Oriented diameter of maximal outerplanar graphs.
J. Graph Theory, 2021
Domination, independent domination number and 2-independence number in trees.
Discuss. Math. Graph Theory, 2021
Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected.
Complex., 2021
2020
Total Roman {3}-domination in Graphs.
Symmetry, 2020
The double Roman domatic number of a digraph.
Discuss. Math. Graph Theory, 2020
Critical concept for double Roman domination in graphs.
Discret. Math. Algorithms Appl., 2020
Roman {3}-domination (double Italian domination).
Discret. Appl. Math., 2020
A proof of a conjecture on the differential of a subcubic graph.
Discret. Appl. Math., 2020
Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs.
Contributions Discret. Math., 2020
Varieties of Roman domination II.
AKCE Int. J. Graphs Comb., 2020
2019
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number.
Discuss. Math. Graph Theory, 2019
On the co-Roman domination in graphs.
Discuss. Math. Graph Theory, 2019
Bounds on the signed Roman <i>k</i>-domination number of a digraph.
Discuss. Math. Graph Theory, 2019
The Roman {2}-domatic number of graphs.
Discret. Appl. Math., 2019
Bounds on the fair total domination number in trees and unicyclic graphs.
Australas. J Comb., 2019
2018
An upper bound on the double Roman domination number.
J. Comb. Optim., 2018
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number.
Discret. Math., 2018
2017
An introduction to the twin signed total <i>k</i>-domination numbers in directed graphs.
RAIRO Oper. Res., 2017
Roman game domination number of a graph.
J. Comb. Optim., 2017
On the signed 2-independence number of graphs.
Electron. J. Graph Theory Appl., 2017
The signed total Roman <i>k</i>-domatic number of a graph.
Discuss. Math. Graph Theory, 2017
Signed total Roman domination in digraphs.
Discuss. Math. Graph Theory, 2017
Signed Roman edge <i>k</i>-domination in graphs.
Discuss. Math. Graph Theory, 2017
Universal arcs in local tournaments.
Discret. Math., 2017
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs.
Discret. Appl. Math., 2017
The k-rainbow reinforcement numbers in graphs.
Discret. Appl. Math., 2017
Lower bounds on the signed k-domination number of graphs.
Ars Comb., 2017
2016
Generalization of the total outer-connected domination in graphs.
RAIRO Oper. Res., 2016
Signed total Roman domination in graphs.
J. Comb. Optim., 2016
Signed Roman edge domination numbers in graphs.
J. Comb. Optim., 2016
Signed mixed Roman domination numbers in graphs.
J. Comb. Optim., 2016
Signed Roman k-domination in Digraphs.
Graphs Comb., 2016
Edge-Removal and Edge-Addition in α-Domination.
Graphs Comb., 2016
Signed Roman k-Domination in Graphs.
Graphs Comb., 2016
New bounds on the signed total domination number of graphs.
Discuss. Math. Graph Theory, 2016
On the signed total Roman domination and domatic numbers of graphs.
Discret. Appl. Math., 2016
Signed (j, k)-domatic number of graphs.
Ars Comb., 2016
Matchings in 4-total restrained domination vertex critical graphs.
Ars Comb., 2016
Rainbow restrained domination numbers in graphs.
Ars Comb., 2016
On the rainbow restrained domination number.
Ars Comb., 2016
Total restrained reinforcement in graphs.
AKCE Int. J. Graphs Comb., 2016
The signed Roman k-domatic number of digraphs.
Australas. J Comb., 2016
2015
Signed Roman domination in digraphs.
J. Comb. Optim., 2015
Global Roman Domination in Trees.
Graphs Comb., 2015
The signed Roman domatic number of a digraph.
Electron. J. Graph Theory Appl., 2015
Upper bounds on the signed total (<i>k, k</i>)-domatic number of graphs.
Discuss. Math. Graph Theory, 2015
On the signed (total) <i>k</i>-independence number in graphs.
Discuss. Math. Graph Theory, 2015
The <i>k</i>-rainbow bondage number of a digraph.
Discuss. Math. Graph Theory, 2015
Signed star (j, k)-domatic numbers of digraphs.
Discret. Math. Algorithms Appl., 2015
The signed Roman k-domatic number of a graph.
Discret. Appl. Math., 2015
Signed Roman k-domination in trees.
Discret. Appl. Math., 2015
Signed k-domatic numbers of graphs.
Ars Comb., 2015
2014
The k-rainbow bondage number of a graph.
Discret. Appl. Math., 2014
Bounds on the k-independence and k-chromatic numbers of graphs.
Ars Comb., 2014
2013
Roman Domination Dot-critical Graphs.
Graphs Comb., 2013
Bounds on the signed 2-independence number in graphs.
Discuss. Math. Graph Theory, 2013
The distance Roman domination numbers of graphs.
Discuss. Math. Graph Theory, 2013
Complementary cycles in almost regular multipartite tournaments, where one cycle has length four.
Discret. Appl. Math., 2013
A note on the independent domination number in graphs.
Discret. Appl. Math., 2013
Smallest regular and almost regular triangle-free graphs without perfect matchings.
Ars Comb., 2013
Signed total (j, k)-domatic numbers of graphs.
Australas. J Comb., 2013
2012
The total {k}-domatic number of a graph.
J. Comb. Optim., 2012
k-Domination and k-Independence in Graphs: A Survey.
Graphs Comb., 2012
The total {<i>k</i>}-domatic number of digraphs.
Discuss. Math. Graph Theory, 2012
The <i>k</i>-rainbow domatic number of a graph.
Discuss. Math. Graph Theory, 2012
Signed total {k}-domination and {k}-Domatic numbers of Graphs.
Discret. Math. Algorithms Appl., 2012
Signed 2-independence in digraphs.
Discret. Math., 2012
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected.
Discret. Appl. Math., 2012
On regular (2, q)-extendable graphs.
Ars Comb., 2012
The smallest regular graphs which are not 1-extendable.
Ars Comb., 2012
2011
Independence and <i>k</i>-domination in graphs.
Int. J. Comput. Math., 2011
On the Roman Bondage Number of Planar Graphs.
Graphs Comb., 2011
Connected global offensive <i>k</i>-alliances in graphs.
Discuss. Math. Graph Theory, 2011
Signed domination and signed domatic numbers of digraphs.
Discuss. Math. Graph Theory, 2011
Discuss. Math. Graph Theory, 2011
Characterization of trees with equal 2-domination number and domination number plus two.
Discuss. Math. Graph Theory, 2011
Upper bounds on the signed total domatic number of graphs.
Discret. Appl. Math., 2011
Unique response Roman domination in graphs.
Discret. Appl. Math., 2011
Signed star k-domatic number of a graph.
Contributions Discret. Math., 2011
Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.
Ars Comb., 2011
On 2-domination and independence domination numbers of graphs.
Ars Comb., 2011
Bounds on the signed domatic number.
Appl. Math. Lett., 2011
Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph.
Appl. Math. Lett., 2011
On local connectivity of K<sub>2, p</sub>-free graphs.
Australas. J Comb., 2011
2-domination in bipartite graphs with odd independence number.
Australas. J Comb., 2011
2010
On local connectivity of graphs with given clique number.
J. Graph Theory, 2010
Proof of a conjecture on game domination.
J. Graph Theory, 2010
A general method in the theory of domination in graphs.
Int. J. Comput. Math., 2010
<i>k</i>-independence stable graphs upon edge removal.
Discuss. Math. Graph Theory, 2010
Cycle factors in strongly connected local tournaments.
Discret. Math., 2010
On the geodetic and geodetic domination numbers of a graph.
Discret. Math., 2010
Signed star domatic number of a graph.
Discret. Appl. Math., 2010
The Diameter of Almost Eulerian Digraphs.
Electron. J. Comb., 2010
Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number.
Ars Comb., 2010
The Roman domatic number of a graph.
Appl. Math. Lett., 2010
On almost 1-extendable graphs.
Australas. J Comb., 2010
Independence and global offensive alliance in graphs.
Australas. J Comb., 2010
2009
A remark on degree sequences of multigraphs.
Math. Methods Oper. Res., 2009
Minimum size of a graph or digraph of given radius.
Inf. Process. Lett., 2009
Bounds on the global offensive <i>k</i>-alliance number in graphs.
Discuss. Math. Graph Theory, 2009
Every cycle-connected multipartite tournament has a universal arc.
Discret. Math., 2009
On the existence of edge cuts leaving several large components.
Discret. Math., 2009
On the number of cycles in local tournaments.
Discret. Math., 2009
Parity and disparity subgraphs.
Discret. Math., 2009
On the connectivity of p-diamond-free graphs.
Discret. Math., 2009
Complementary cycles in regular multipartite tournaments, where one cycle has length five.
Discret. Math., 2009
Inverse degree and edge-connectivity.
Discret. Math., 2009
The signed domatic number of some regular graphs.
Discret. Appl. Math., 2009
Upper bounds on the k-domination number and the k-Roman domination number.
Discret. Appl. Math., 2009
Some remarks on the signed domatic number of graphs with small minimum degree.
Appl. Math. Lett., 2009
On regular (1, q)-extendable graphs.
Australas. J Comb., 2009
A characterization of even order trees with domination number half their order minus one.
Australas. J Comb., 2009
Global offensive alliance numbers in graphs with emphasis on trees.
Australas. J Comb., 2009
2008
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.
Networks, 2008
On <i>k</i>-domination and minimum degree in graphs.
J. Graph Theory, 2008
A remark on the (2, 2)-domination number.
Discuss. Math. Graph Theory, 2008
Strong subtournaments containing a given vertex in regular multipartite tournaments.
Discret. Math., 2008
Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5.
Discret. Math., 2008
Some remarks on lambda<sub>p, q</sub>-connectedness.
Discret. Math., 2008
On arc-traceable local tournaments.
Discret. Math., 2008
All 2-connected in-tournaments that are cycle complementary.
Discret. Math., 2008
Maximally edge-connected and vertex-connected graphs and digraphs: A survey.
Discret. Math., 2008
On graphs with equal domination and 2-domination numbers.
Discret. Math., 2008
alpha-Domination perfect trees.
Discret. Math., 2008
The connectivity of a graph and its complement.
Discret. Appl. Math., 2008
How close to regular must a multipartite tournament be to secure a given path covering number?
Ars Comb., 2008
On local connectivity of graphs.
Appl. Math. Lett., 2008
On the order of almost regular bipartite graphs without perfect matchings.
Australas. J Comb., 2008
A characterization of bipartite graphs with independence number half their order.
Australas. J Comb., 2008
Restricted arc-connectivity of generalized tournaments.
Australas. J Comb., 2008
A note on the 2-domination number of a tree.
Australas. J Comb., 2008
2007
Restricted arc-connectivity of digraphs.
Inf. Process. Lett., 2007
Characterization of block graphs with equal 2-domination number and domination number plus one.
Discuss. Math. Graph Theory, 2007
Local-edge-connectivity in digraphs and oriented graphs.
Discret. Math., 2007
Multipartite tournaments: A survey.
Discret. Math., 2007
Strongly 4-path-connectivity in almost regular multipartite tournaments.
Discret. Math., 2007
On the connectivity of diamond-free graphs.
Discret. Appl. Math., 2007
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs.
Electron. J. Comb., 2007
Distance Domination and Distance Irredundance in Graphs.
Electron. J. Comb., 2007
On the order of close to regular graphs without a matching of given size.
Ars Comb., 2007
Average distance in bipartite tournaments.
Ars Comb., 2007
A remark on cycles through an arc in strongly connected multipartite tournaments.
Appl. Math. Lett., 2007
New bounds on the <i>k</i>-domination number and the <i>k</i>-tuple domination number.
Appl. Math. Lett., 2007
On the number of nonseparating vertices in strongly connected local tournaments.
Australas. J Comb., 2007
Total and connected domination in digraphs.
Australas. J Comb., 2007
2006
On connectivity in graphs with given clique number.
J. Graph Theory, 2006
Otto Blumenthal (1876-1944) in retrospect.
J. Approx. Theory, 2006
Lower bounds on the vertex-connectivity of digraphs and graphs.
Inf. Process. Lett., 2006
A lower bound for the irredundance number of trees.
Discuss. Math. Graph Theory, 2006
Extremal bipartite graphs with a unique k-factor.
Discuss. Math. Graph Theory, 2006
Paths with a given number of vertices from each partite set in regular multipartite tournaments.
Discret. Math., 2006
Longest cycles in almost regular 3-partite tournaments.
Discret. Math., 2006
On cycles in regular 3-partite tournaments.
Discret. Math., 2006
Some bounds on the p-domination number in trees.
Discret. Math., 2006
On the connectivity of close to regular multipartite tournaments.
Discret. Appl. Math., 2006
Upper bounds on the domination number of a graph in terms of order and minimum degree.
Ars Comb., 2006
Degree sequence conditions for maximally edge-connected oriented graphs.
Appl. Math. Lett., 2006
Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree.
Australas. J Comb., 2006
On the order of almost regular graphs without a matching of given size.
Australas. J Comb., 2006
2005
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected.
J. Graph Theory, 2005
Structural Remarks on Bipartite Graphs with Unique <i>f</i>-Factors.
Graphs Comb., 2005
On the p-domination number of cactus graphs.
Discuss. Math. Graph Theory, 2005
Cuts leaving components of given minimum order.
Discret. Math., 2005
Unique irredundance, domination and independent domination in graphs.
Discret. Math., 2005
Signed domatic number of a graph.
Discret. Appl. Math., 2005
A note on the number of matchings and independent sets in trees.
Discret. Appl. Math., 2005
Extremal Trees with Respect to Dominance Order.
Ars Comb., 2005
Average distance in k-connected tournaments.
Ars Comb., 2005
Complementary cycles in regular multipartite tournaments.
Australas. J Comb., 2005
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c.
Australas. J Comb., 2005
Neighborhood conditions for graphs and digraphs to be maximally edge-connected.
Australas. J Comb., 2005
2004
Note on the connectivity of line graphs.
Inf. Process. Lett., 2004
Extendable Cycles in Multipartite Tournaments.
Graphs Comb., 2004
Some remarks on alpha-domination.
Discuss. Math. Graph Theory, 2004
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments.
Discret. Math., 2004
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc.
Discret. Math., 2004
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments.
Discret. Math., 2004
The Petersen graph is not 1-factorable: postscript to The Petersen graph is not 3-edge-colorable - a new proof' [Discrete Math. 268 (2003) 325-326].
Discret. Math., 2004
Hamiltonian paths containing a given arc, in almost regular bipartite tournaments.
Discret. Math., 2004
All regular multipartite tournaments that are cycle complementary.
Discret. Math., 2004
Vertex 6-pancyclic in-tournaments.
Discret. Math., 2004
On unique <i>k</i>-factors and unique [1, <i>k</i>]-factors in graphs.
Discret. Math., 2004
Sufficient conditions for lambda'-optimality in graphs of diameter 2.
Discret. Math., 2004
Relations between the lower domination parameters and the chromatic number of a graph.
Discret. Math., 2004
On Regular Factors in Regular Graphs with Small Radius.
Electron. J. Comb., 2004
The Maximum Size Of Graphs With A Unique <i>k</i>- Factor.
Comb., 2004
Maximally local-edge-connected graphs and digraphs.
Ars Comb., 2004
On the size of odd order graphs with no almost perfect matching.
Australas. J Comb., 2004
2003
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number.
J. Graph Theory, 2003
Extremal subgraphs with respect to vertex degree bounds.
Discret. Math., 2003
On alpha<sub>r</sub>gamma<sub>s</sub>(<i>k</i>)-perfect graphs.
Discret. Math., 2003
Maximum graphs with a unique minimum dominating set.
Discret. Math., 2003
Remarks on the bondage number of planar graphs.
Discret. Math., 2003
A Linear-programming Approach to the Generalized Randic Index.
Discret. Appl. Math., 2003
Cycles of length four through a given arc in almost regular multipartite tournaments.
Ars Comb., 2003
Degree sequence conditions for super-edge-connected graphs and digraphs.
Ars Comb., 2003
Restricted edge-connectivity and minimum edge-degree.
Ars Comb., 2003
Cycles through a given arc in almost regular multipartite tournaments.
Australas. J Comb., 2003
Maximally edge-connected digraphs.
Australas. J Comb., 2003
Minimum degree conditions for the Overfull Conjecture for odd order graphs.
Australas. J Comb., 2003
2002
Proof of a conjecture on irredundance perfect graphs.
J. Graph Theory, 2002
How local irregularity gets global in a graph.
J. Graph Theory, 2002
A disproof of Henning's conjecture on irredundance perfect graphs.
Discret. Math., 2002
Cycles in multipartite tournaments: results and problems.
Discret. Math., 2002
Longest paths through an arc in strong semicomplete multipartite digraphs.
Discret. Math., 2002
Almost all almost regular <i>c</i>-partite tournaments with <i>c</i>geq5 are vertex pancyclic.
Discret. Math., 2002
Independent domination and matchings in graphs.
Discret. Math., 2002
Weighted domination in triangle-free graphs.
Discret. Math., 2002
Edge-cuts leaving components of order at least three.
Discret. Math., 2002
Discret. Appl. Math., 2002
Graphs having distance-n domination number half their order.
Discret. Appl. Math., 2002
Wiener index versus maximum degree in trees.
Discret. Appl. Math., 2002
Cycles through a given arc in certain almost regular multipartite tournaments.
Australas. J Comb., 2002
Unique minimum domination in trees.
Australas. J Comb., 2002
2001
Vertex pancyclic in-tournaments.
J. Graph Theory, 2001
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.
Discret. Math., 2001
i gamma(1)-perfect graphs.
Discret. Math., 2001
Spanning multipartite tournaments of semicomplete multipartite digraphs.
Ars Comb., 2001
2000
Graphs with unique dominating sets.
Electron. Notes Discret. Math., 2000
Some results on graph parameters in weighted graphs.
Electron. Notes Discret. Math., 2000
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
Discret. Math., 2000
A characterization of rho alpha(<i>k</i>)-perfect graphs.
Discret. Math., 2000
Degree sequence conditions for maximally edge-connected graphs depending on the clique number.
Discret. Math., 2000
Longest paths through an arc in strongly connected in-tournaments.
Australas. J Comb., 2000
1999
Maximal Sets of 2-Factors in Complete Equipartite Graphs.
Electron. Notes Discret. Math., 1999
Longest paths in semicomplete multipartite digraphs.
Discret. Math., 1999
Vertex deletion and cycles in multipartite tournaments.
Discret. Math., 1999
Strong subtournaments of multipartite tournaments.
Australas. J Comb., 1999
1998
The ratio of the irredundance and domination number of a graph.
Discret. Math., 1998
The domatic number of block-cactus graphs.
Discret. Math., 1998
Characterization of graphs with equal domination and covering number.
Discret. Math., 1998
On the cycle structure of in-tournaments.
Australas. J Comb., 1998
Some structural results on linear arboricity.
Australas. J Comb., 1998
1997
Degree sequence conditions for maximally edge-connected graphs and digraphs.
J. Graph Theory, 1997
On cycles through a given vertex in multipartite tournaments.
Discret. Math., 1997
A classification of locally semicomplete digraphs.
Discret. Math., 1997
Discret. Appl. Math., 1997
Simplicial Graphs and Relationships to Different Graph Invariants.
Ars Comb., 1997
1996
Locally semicomplete digraphs that are complementary <i>m</i>-pancyclic.
J. Graph Theory, 1996
Weakly Hamiltonian-connected locally semicomplete digraphs.
J. Graph Theory, 1996
A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments.
J. Comb. Theory B, 1996
Independence number in n-extendable graphs.
Discret. Math., 1996
Neighbourhood and degree conditions for the existence of regular factors.
Ars Comb., 1996
Fundamente der Graphentheorie.
Springer Lehrbuch Mathematik, Springer, ISBN: 978-3-211-82774-1, 1996
1995
A generalization of menger's theorem for certain block - cactus graphs.
Graphs Comb., 1995
On graphs with equal domination and edge independence numbers.
Ars Comb., 1995
New sufficient conditions for equality of minimum degree and edge-connectivity.
Ars Comb., 1995
1994
Connectivity properties of locally semicomplete digraphs.
J. Graph Theory, 1994
Cycles in Multipartite Tournaments.
J. Comb. Theory B, 1994
On unique independent sets in graphs.
Discret. Math., 1994
On complementary cycles in locally semicomplete digraphs.
Discret. Math., 1994
on Graphs with Equal Domination and Covering Numbers.
Discret. Appl. Math., 1994
A characterization of well covered block-cactus graphs.
Australas. J Comb., 1994
1993
Sufficient conditions for equality of connectivity and minimum degree of a graph.
J. Graph Theory, 1993
A new domination conception.
J. Graph Theory, 1993
Some upper bounds for the product of the domination number and the chromatic number of a graph.
Discret. Math., 1993
1991
On packing and covering numbers of graphs.
Discret. Math., 1991
On graphs with equal domination and independent domination numbers.
Discret. Math., 1991
1990
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree.
J. Graph Theory, 1990
Estimations for the domination number of a graph.
Discret. Math., 1990
1989
Edge-connectivity in p-partite graphs.
J. Graph Theory, 1989
