2 citations · 2 across the 6 of their papers we have counts for
6 papers
Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges
C. M. Mynhardt, A. K. Wright
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple ed…
Lower Bound and Exact Values for the Boundary Independence Broadcast Number of a Tree
C. M. Mynhardt, L. Neilson
A broadcast on a nontrivial connected graph G is a function f from V(G) to the set {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all vertices v of G. The we…
Irredundance Trees of Diameter 3
C. M. Mynhardt, A. Roux
A set D of vertices of a graph G with vertex set V is irredundant if each non-isolated vertex of G[D] has a neighbour in V-D that is not adjacent to any other vertex in D. The uppe…
A Sharp Upper Bound for the Boundary Independence Broadcast Number of a Tree
C. M. Mynhardt, L. Neilson
A broadcast on a nontrivial connected graph G with vertex set V is a function f from V to {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all vertices v. The…
Comparing Upper Broadcast Domination and Boundary Independence Numbers of Graphs
C. M. Mynhardt, L. Neilson
A broadcast on a nontrivial connected graph G with vertex set V is a function f from V to {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all v in V. The weig…
Irredundance Graphs
Kieka Mynhardt, Riana Roux
A set D of vertices of a graph G=(V,E) is irredundant if each v of D satisfies (a) v is isolated in the subgraph induced by D, or (b) v is adjacent to a vertex in V-D that is nonad…