Henda C. Swart

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