Henda C. Swart

Publication Activity (10 Years)

Years Active: 1980-2014
Publications (10 Years): 0

Top Topics

Subgraph Isomorphism

Subgraph Mining

Frequently Occurring

Structured Data

Top Venues

Inf. Process. Lett.

Discret. Appl. Math.

Australas. J Comb.

Publications

Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58 (2014)
M. J. Morgan, Simon Mukwembi, Henda C. Swart
A lower bound on the eccentric connectivity index of a graph. Discret. Appl. Math. 160 (3) (2012)
Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112 (24) (2012)
M. J. Morgan, Simon Mukwembi, Henda C. Swart
On the eccentric connectivity index of a graph. Discret. Math. 311 (13) (2011)
Peter Dankelmann, Henda C. Swart, Paul van den Berg
The number of edges in a bipartite graph of given radius. Discret. Math. 311 (8-9) (2011)
Peter Dankelmann, Simon Mukwembi, Henda C. Swart
Average distance and vertex-connectivity. J. Graph Theory 62 (2) (2009)
Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart
The edge-Wiener index of a graph. Discret. Math. 309 (10) (2009)
Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart
On the degree distance of a graph. Discret. Appl. Math. 157 (13) (2009)
Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart
Domination with exponential decay. Discret. Math. 309 (19) (2009)
Peter Dankelmann, Simon Mukwembi, Henda C. Swart
Average Distance and Edge-Connectivity I. SIAM J. Discret. Math. 22 (1) (2008)
Peter Dankelmann, Simon Mukwembi, Henda C. Swart
Average Distance and Edge-Connectivity II. SIAM J. Discret. Math. 21 (4) (2008)
Peter Dankelmann, Henda C. Swart, Paul van den Berg
Diameter and inverse degree. Discret. Math. 308 (5-6) (2008)
Peter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart
On equality in an upper bound for the restrained and total domination numbers of a graph. Discret. Math. 307 (22) (2007)
Peter Dankelmann, Johannes H. Hattingh, Michael A. Henning, Henda C. Swart
Trees with Equal Domination and Restrained Domination Numbers. J. Glob. Optim. 34 (4) (2006)
Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart
Maximum sizes of graphs with given domination parameters. Discret. Math. 281 (1-3) (2004)
Peter Dankelmann, Henda C. Swart, David P. Day
On strong distances in oriented graphs. Discret. Math. 266 (1-3) (2003)
Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
Twin Domination in Digraphs. Ars Comb. 67 (2003)
Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131 (1) (2003)
Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116 (1-2) (2002)
David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
Multipartite Ramsey Numbers. Ars Comb. 58 (2001)
Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999)
David P. Day, Ortrud R. Oellermann, Henda C. Swart
Bounds on the size of graphs of given order and up/down-connectivity. Discret. Math. (1999)
Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
Generalized eccentricity, radius, and diameter in graphs. Networks 34 (4) (1999)
Peter Dankelmann, Vivienne Smithdorf, Henda C. Swart
Radius-forcing sets in graphs. Australas. J Comb. 17 (1998)
Peter Dankelmann, Henda C. Swart, Ortrud Oellermann
On the Average Steiner Distance of Graphs with Prescribed Properties. Discret. Appl. Math. 79 (1-3) (1997)
David P. Day, Ortrud Oellermann, Henda C. Swart
A characterization of 3-Steiner distance hereditary graphs. Networks 30 (4) (1997)
Wayne Goddard, Michael D. Plummer, Henda C. Swart
Maximum and minimum toughness of graphs of small genus. Discret. Math. (1997)
Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart
An Algorithm to Find Two Distance Domination Parameters in a Graph. Discret. Appl. Math. 68 (1-2) (1996)
Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
The diversity of domination. Discret. Math. 161 (1-3) (1996)
Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
Local edge domination critical graphs. Discret. Math. 161 (1-3) (1996)
Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart
The average Steiner distance of a graph. J. Graph Theory 22 (1) (1996)
Wayne Goddard, Henda C. Swart
Distances between graphs under edge operations. Discret. Math. 161 (1-3) (1996)
Timothy J. Bean, Michael A. Henning, Henda C. Swart
On the integrity of distance domination in graphs. Australas. J Comb. 10 (1994)
Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart
Steiner distance stable graphs. Discret. Math. 132 (1-3) (1994)
David P. Day, Ortrud Oellermann, Henda C. Swart
Steiner Distance-Hereditary Graphs. SIAM J. Discret. Math. 7 (3) (1994)
David P. Day, Ortrud R. Oellermann, Henda C. Swart
On the l-connectivity of a diagraph. Discret. Math. 127 (1-3) (1994)
Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart
Principal Common Divisors of Graphs. Eur. J. Comb. 14 (2) (1993)
Michael A. Henning, Henda C. Swart
Bounds relating generalized domination parameters. Discret. Math. 120 (1-3) (1993)
Wayne Goddard, Michael A. Henning, Henda C. Swart
Some nordhaus- gaddum-type results. J. Graph Theory 16 (3) (1992)
Roger C. Entringer, Henda C. Swart
Spanning cycles of nearly cubic graphs. J. Comb. Theory, Ser. B 29 (3) (1980)