Kieka Mynhardt | Academic Influence

Kieka Mynhardt's AcademicInfluence.com Rankings

Kieka Mynhardt

Mathematics

#5642

World Rank

#7930

Historical Rank

Measure Theory

#4182

World Rank

#4926

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Kieka Mynhardt's Degrees

PhD Mathematics University of Cape Town
Masters Mathematics University of Cape Town
Bachelors Mathematics University of Cape Town

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Kieka Mynhardt Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Christina Magdalena Mynhardt is a South African born Canadian mathematician known for her work on dominating sets in graph theory, including domination versions of the eight queens puzzle. She is a professor of mathematics and statistics at the University of Victoria in Canada.

(See a Problem?)

Kieka Mynhardt's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Total domination in graphs with minimum degree three (2000) (68)
Construction of trees and graphs with equal domination parameters (2006) (57)
Radial trees (2009) (57)
Protecting a Graph with Mobile Guards (2014) (50)
Secure domination and secure total domination in graphs (2008) (47)
Vertices contained in all or in no minimum total dominating set of a tree (2003) (44)
Total Domination Edge Critical Graphs with Minimum Diameter (2001) (43)
Vertices contained in every minimum dominating set of a tree (1999) (43)
On a generalization of signed dominating functions of graphs (1996) (37)
Generalized colorings of outerplanar and planar graphs (1985) (34)
Graphs with equal eternal vertex cover and eternal domination numbers (2011) (33)
Generalized colorings of graphs (1985) (28)
Secure domination critical graphs (2009) (28)
Domination critical graphs with higher independent domination numbers (1996) (27)
Edge protection in graphs (2009) (26)
New bounds for the broadcast domination number of a graph (2013) (26)
Total dominating functions in trees: Minimality and convexity (1995) (24)
The sequence of upper and lower domination, independence and irredundance numbers of a graph (1993) (24)
Broadcasts and domination in trees (2011) (23)
A characterization of (γ, i)-trees (2000) (23)
Irredundance and Maximum Degree in Graphs (1997) (22)
Reconfiguration of Colourings and Dominating Sets in Graphs (2019) (21)
On the domination number of prisms of graphs (2004) (20)
Universal minimal total dominating functions in graphs (1994) (20)
Properties of minimal dominating functions of graphs (1995) (20)
Vertex covers and eternal dominating sets (2012) (19)
On the product of upper irredundance numbers of a graph and its complement (1989) (17)
An improved upper bound for queens domination numbers (2003) (16)
Domination and irredundance in the queens' graph (1997) (16)
Altitude of regular graphs with girth at least five (2005) (16)
Irredundant ramsey numbers for graphs (1989) (15)
On generalised minimal domination parameters for paths (1991) (15)
The diameter of paired-domination vertex critical graphs (2008) (15)
On equality in an upper bound for domination parameters of graphs (1997) (14)
THE IRREDUNDANT RAMSEY NUMBER s(3,6) (1990) (14)
Dominating and irredundant broadcasts in graphs (2016) (14)
An upper bound for the minimum number of queens covering the n x n chessboard (2002) (13)
Altitude of small complete and complete bipartite graphs (2005) (13)
Queens graphs for chessboards on the torus (2001) (13)
Eternal Total Domination in Graphs (2012) (12)
On a Nordhaus-Gaddum type problem for independent domination (1995) (12)
Irredundant and perfect neighbourhood sets in trees (1998) (12)
Regular graphs are not universal fixers (2010) (11)
A class of trees with equal broadcast and domination numbers (2013) (11)
J ul 2 01 7 A note on some variations of the γ-graph (2017) (11)
More trees with equal broadcast and domination numbers (2015) (11)
Convexity of minimal dominating functions of trees - II (1994) (10)
The domination number of the toroidal queens graph of size 3k×3k (2003) (10)
On 1-dependent ramsey numbers for graphs (1999) (10)
A characterisation of universal minimal total dominating functions in trees (1995) (9)
Connected k-dominating graphs (2017) (9)
Vertex criticality for upper domination and irredundance (2001) (8)
Trees with domination subdivision number one (2008) (8)
Nordhaus-Gaddum results for CO-irredundance in graphs (2000) (8)
Domination parameters and edge-removal-critical graphs (2001) (8)
Domination and irredundance in cubic graphs (1997) (8)
Claw-free graphs are not universal fixers (2009) (8)
Upper bounds for the domination numbers of toroidal queens graphs (2003) (7)
Critical Graphs With Respect to Vertex Identification (2008) (7)
The irredundant Ramsey number s (3, 3, 3) = 13 (1994) (7)
Maximal Nontraceable Graphs with Toughness less than One (2008) (6)
Independent protection in graphs (2014) (6)
Broadcasts in Graphs: Diametrical Trees (2017) (6)
Paired domination in prisms of graphs (2011) (6)
Diameter of paired domination edge-critical graphs (2008) (6)
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs (1998) (6)
Domination, Eternal Domination, and Clique Covering (2014) (6)
Trees with depression three (2008) (6)
Domination of generalized Cartesian products (2010) (6)
GENERALISED MAXIMAL INDEPENDENCE PARAMETERS FOR PATHS AND CYCLES (1990) (5)
Ramsey properties of generalised irredundant sets in graphs (2001) (5)
An inequality chain of domination parameters for trees (1998) (5)
Boundary Independent Broadcasts in Graphs (2019) (5)
On the sizes of least common multiples of several pairs of graphs (1996) (5)
Total domination in Kr-covered graphs (2004) (5)
A lower bound for the depression of trees (2006) (5)
Properties of Queens graphs and the irredundance number of Q7 (2001) (4)
A dynamic domination problem in trees (2015) (4)
Open irredundance and maximum degree in graphs (2008) (4)
Minimality and convexity of dominating and related functions in graphs: A unifying theory (1997) (4)
GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS (1988) (4)
On i--ER-critical graphs (2004) (3)
Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs (2019) (3)
On Graphs With a Unique Least Common Multiple (1997) (3)
A class of graphs with depression three (2013) (3)
CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY (1993) (3)
A note on some variations of the $\gamma$-graph (2017) (3)
Triangle Decompositions of Planar Graphs (2015) (3)
Total Roman domination edge-critical graphs (2019) (3)
Remarks on the critical graph conjecture (1979) (2)
The depression of a graph and k-kernels (2014) (2)
Degree Uniform Graphs a (1989) (2)
On k-total dominating graphs (2017) (2)
Changing upper irredundance by edge addition (2003) (2)
Eternal and Secure Domination in Graphs (2020) (1)
A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (2019) (1)
Block Graphs with Large Paired Domination Multisubdivision Number (2019) (1)
A construction of a class of graphs with depression three (2014) (1)
Generalised Ramsey Numbers with respect to Classes of Graphs (2001) (1)
Degree sets of degree uniform graphs (1985) (1)
Characterizing Cartesian fixers and multipliers (2012) (1)
The k-conversion number of regular graphs (2018) (1)
Total Roman domination edge-supercritical and edge-removal-supercritical graphs (2020) (0)
Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs (2020) (0)
COUNTEREXAMPLE TO A CONJECTURE ON THE STRUCTURE OF BIPARTITE PARTITIONABLE GRAPHS (2007) (0)
Universal maximal packing functions of graphs (1996) (0)
Couterexample to a conjecture on the structure of bipartite partionable graphs (2007) (0)
G-constructibility of planar graphs (1980) (0)
Ju l 2 01 9 Total Roman Domination Edge-Critical Graphs (2019) (0)
C O ] 6 J ul 2 01 9 Boundary Independent Broadcasts in Graphs (2019) (0)
BLOCK GRAPHS WITH LARGE PAIRED DOMINATION (2019) (0)
Lower Ramsey numbers for graphs (1991) (0)
C O ] 1 7 A ug 2 01 7 Broadcasts in Graphs : Diametrical Trees (0)
EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS (1996) (0)
1799 DOMINATION , ETERNAL DOMINATION AND CLIQUE COVERING (2019) (0)
On i-minus-Edge-Removal-critical graphs (2000) (0)
N-queens — 330 References How It All Began One Article to Hold Them All Searchable Online Database (2011) (0)

This paper list is powered by the following services:

Other Resources About Kieka Mynhardt

en.wikipedia.org

What Schools Are Affiliated With Kieka Mynhardt?

Kieka Mynhardt is affiliated with the following schools: