Spanning cycles of nearly cubic graphs. - Roger C. Entringer; Henda C. Swart (J. Comb. Theory B, 1980)

Some nordhaus- gaddum-type results. - Wayne Goddard; Michael A. Henning; Henda C. Swart (J. Graph Theory, 1992)

Bounds relating generalized domination parameters. - Michael A. Henning; Henda C. Swart (Discret. Math., 1993)

Principal Common Divisors of Graphs. - Gary Chartrand; Wayne Goddard; Michael A. Henning; Farrokh Saba; Henda C. Swart (Eur. J. Comb., 1993)

On the integrity of distance domination in graphs. - Timothy J. Bean; Michael A. Henning; Henda C. Swart (Australas. J Comb., 1994)

On the l-connectivity of a diagraph. - David P. Day; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1994)

Steiner distance stable graphs. - Wayne Goddard; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1994)

Steiner Distance-Hereditary Graphs. - David P. Day; Ortrud Oellermann; Henda C. Swart (SIAM J. Discret. Math., 1994)

An Algorithm to Find Two Distance Domination Parameters in a Graph. - Gerd Fricke; Michael A. Henning; Ortrud Oellermann; Henda C. Swart (Discret. Appl. Math., 1996)

Distances between graphs under edge operations. - Wayne Goddard; Henda C. Swart (Discret. Math., 1996)

The diversity of domination. - Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1996)

Local edge domination critical graphs. - Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1996)

The average Steiner distance of a graph. - Peter Dankelmann; Ortrud R. Oellermann; Henda C. Swart (J. Graph Theory, 1996)

On the Average Steiner Distance of Graphs with Prescribed Properties. - Peter Dankelmann; Henda C. Swart; Ortrud Oellermann (Discret. Appl. Math., 1997)

Maximum and minimum toughness of graphs of small genus. - Wayne Goddard; Michael D. Plummer; Henda C. Swart (Discret. Math., 1997)

A characterization of 3-Steiner distance hereditary graphs. - David P. Day; Ortrud Oellermann; Henda C. Swart (Networks, 1997)

Radius-forcing sets in graphs. - Peter Dankelmann; Vivienne Smithdorf; Henda C. Swart (Australas. J Comb., 1998)

Bounds on the Total Redundance and Efficiency of a Graph. - Wayne Goddard; Ortrud Oellermann; Peter J. Slater; Henda C. Swart (Ars Comb., 1999)

Bounds on the size of graphs of given order and up/down-connectivity. - David P. Day; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1999)

Generalized eccentricity, radius, and diameter in graphs. - Peter Dankelmann; Wayne Goddard; Michael A. Henning; Henda C. Swart (Networks, 1999)

Multipartite Ramsey Numbers. - David P. Day; Wayne Goddard; Michael A. Henning; Henda C. Swart (Ars Comb., 2001)

Augmenting trees so that every three vertices lie on a cycle. - Peter Dankelmann; Wayne Goddard; Ortrud Oellermann; Henda C. Swart (Discret. Appl. Math., 2002)

Twin Domination in Digraphs. - Gary Chartrand; Peter Dankelmann; Michelle Schultz; Henda C. Swart (Ars Comb., 2003)

MAD trees and distance-hereditary graphs. - Elias Dahlhaus; Peter Dankelmann; Wayne Goddard; Henda C. Swart (Discret. Appl. Math., 2003)

On strong distances in oriented graphs. - Peter Dankelmann; Henda C. Swart; David P. Day (Discret. Math., 2003)

Maximum sizes of graphs with given domination parameters. - Peter Dankelmann; Gayla S. Domke; Wayne Goddard; Paul J. P. Grobler; Johannes H. Hattingh; Henda C. Swart (Discret. Math., 2004)

Trees with Equal Domination and Restrained Domination Numbers. - Peter Dankelmann; Johannes H. Hattingh; Michael A. Henning; Henda C. Swart (J. Glob. Optim., 2006)

On equality in an upper bound for the restrained and total domination numbers of a graph. - Peter Dankelmann; David P. Day; Johannes H. Hattingh; Michael A. Henning; Lisa R. Markus; Henda C. Swart (Discret. Math., 2007)

Diameter and inverse degree. - Peter Dankelmann; Henda C. Swart; Paul van den Berg (Discret. Math., 2008)

Average Distance and Edge-Connectivity II. - Peter Dankelmann; Simon Mukwembi; Henda C. Swart (SIAM J. Discret. Math., 2008)

Average Distance and Edge-Connectivity I. - Peter Dankelmann; Simon Mukwembi; Henda C. Swart (SIAM J. Discret. Math., 2008)

On the degree distance of a graph. - Peter Dankelmann; Ivan Gutman; Simon Mukwembi; Henda C. Swart (Discret. Appl. Math., 2009)

Domination with exponential decay. - Peter Dankelmann; David P. Day; David Erwin; Simon Mukwembi; Henda C. Swart (Discret. Math., 2009)

The edge-Wiener index of a graph. - Peter Dankelmann; Ivan Gutman; Simon Mukwembi; Henda C. Swart (Discret. Math., 2009)

Average distance and vertex-connectivity. - Peter Dankelmann; Simon Mukwembi; Henda C. Swart (J. Graph Theory, 2009)

The number of edges in a bipartite graph of given radius. - Peter Dankelmann; Henda C. Swart; Paul van den Berg (Discret. Math., 2011)

On the eccentric connectivity index of a graph. - M. J. Morgan; Simon Mukwembi; Henda C. Swart (Discret. Math., 2011)

A lower bound on the eccentric connectivity index of a graph. - M. J. Morgan; Simon Mukwembi; Henda C. Swart (Discret. Appl. Math., 2012)

Eccentric counts, connectivity and chordality. - Peter Dankelmann; David Erwin; Wayne Goddard; Simon Mukwembi; Henda C. Swart (Inf. Process. Lett., 2012)

A characterisation of eccentric sequences of maximal outerplanar graphs. - Peter Dankelmann; David Erwin; Wayne Goddard; Simon Mukwembi; Henda C. Swart (Australas. J Comb., 2014)