Henda C. Swart - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

2014

A characterisation of eccentric sequences of maximal outerplanar graphsPeter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart. ajc, 58:376, 2014. [doi]

2012

Eccentric counts, connectivity and chordalityPeter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart. ipl, 112(24):944-947, 2012. [doi]

A lower bound on the eccentric connectivity index of a graphM. J. Morgan, Simon Mukwembi, Henda C. Swart. DAM, 160(3):248-258, 2012. [doi]

2011

The number of edges in a bipartite graph of given radiusPeter Dankelmann, Henda C. Swart, Paul van den Berg. DM, 311(8-9):690-698, 2011. [doi]

On the eccentric connectivity index of a graphM. J. Morgan, Simon Mukwembi, Henda C. Swart. DM, 311(13):1229-1234, 2011. [doi]

2009

On the degree distance of a graphPeter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart. DAM, 157(13):2773-2777, 2009. [doi]

Domination with exponential decayPeter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart. DM, 309(19):5877-5883, 2009. [doi]

The edge-Wiener index of a graphPeter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart. DM, 309(10):3452-3457, 2009. [doi]

Average distance and vertex-connectivityPeter Dankelmann, Simon Mukwembi, Henda C. Swart. jgt, 62(2):157-177, 2009. [doi]

2008

Average Distance and Edge-Connectivity IIPeter Dankelmann, Simon Mukwembi, Henda C. Swart. siamdm, 21(4):1035-1052, 2008. [doi]

Diameter and inverse degreePeter Dankelmann, Henda C. Swart, Paul van den Berg. DM, 308(5-6):670-673, 2008. [doi]

Average Distance and Edge-Connectivity IPeter Dankelmann, Simon Mukwembi, Henda C. Swart. siamdm, 22(1):92-101, 2008. [doi]

2007

On equality in an upper bound for the restrained and total domination numbers of a graphPeter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart. DM, 307(22):2845-2852, 2007. [doi]

2006

Trees with Equal Domination and Restrained Domination NumbersPeter Dankelmann, Johannes H. Hattingh, Michael A. Henning, Henda C. Swart. jgo, 34(4):597-607, 2006. [doi]

2004

Maximum sizes of graphs with given domination parametersPeter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart. DM, 281(1-3):137-148, 2004. [doi]

2003

Twin Domination in DigraphsGary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart. arscom, 67, 2003.

MAD trees and distance-hereditary graphsElias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart. DAM, 131(1):151-167, 2003. [doi]

On strong distances in oriented graphsPeter Dankelmann, Henda C. Swart, David P. Day. DM, 266(1-3):195-201, 2003. [doi]

2002

Augmenting trees so that every three vertices lie on a cyclePeter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart. DAM, 116(1-2):145-159, 2002.

2001

Multipartite Ramsey NumbersDavid P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart. arscom, 58, 2001.

1999

Generalized eccentricity, radius, and diameter in graphsPeter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart. networks, 34(4):312-319, 1999. [doi]

Bounds on the size of graphs of given order and up/down-connectivityDavid P. Day, Ortrud R. Oellermann, Henda C. Swart. DM, 197-198:217-223, 1999. [doi]

Bounds on the Total Redundance and Efficiency of a GraphWayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart. arscom, 54, 1999.

1998

Radius-forcing sets in graphsPeter Dankelmann, Vivienne Smithdorf, Henda C. Swart. ajc, 17:39-50, 1998. [doi]

1997

On the Average Steiner Distance of Graphs with Prescribed PropertiesPeter Dankelmann, Henda C. Swart, Ortrud Oellermann. DAM, 79(1-3):91-103, 1997. [doi]

A characterization of 3-Steiner distance hereditary graphsDavid P. Day, Ortrud Oellermann, Henda C. Swart. networks, 30(4):243-253, 1997. [doi]

Maximum and minimum toughness of graphs of small genusWayne Goddard, Michael D. Plummer, Henda C. Swart. DM, 167-168:329-339, 1997. [doi]

1996

The average Steiner distance of a graphPeter Dankelmann, Ortrud R. Oellermann, Henda C. Swart. jgt, 22(1):15-22, 1996. [doi]

An Algorithm to Find Two Distance Domination Parameters in a GraphGerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart. DAM, 68(1-2):85-91, 1996. [doi]

Distances between graphs under edge operationsWayne Goddard, Henda C. Swart. DM, 161(1-3):121-132, 1996. [doi]

The diversity of dominationMichael A. Henning, Ortrud R. Oellermann, Henda C. Swart. DM, 161(1-3):161-173, 1996. [doi]

Local edge domination critical graphsMichael A. Henning, Ortrud R. Oellermann, Henda C. Swart. DM, 161(1-3):175-184, 1996. [doi]

1994

On the integrity of distance domination in graphsTimothy J. Bean, Michael A. Henning, Henda C. Swart. ajc, 10:29-44, 1994. [doi]

Steiner Distance-Hereditary GraphsDavid P. Day, Ortrud Oellermann, Henda C. Swart. siamdm, 7(3):437-442, 1994. [doi]

On the l-connectivity of a diagraphDavid P. Day, Ortrud R. Oellermann, Henda C. Swart. DM, 127(1-3):95-104, 1994. [doi]

Steiner distance stable graphsWayne Goddard, Ortrud R. Oellermann, Henda C. Swart. DM, 132(1-3):65-73, 1994. [doi]

1993

Principal Common Divisors of GraphsGary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart. ejc, 14(2):85-93, 1993. [doi]

Bounds relating generalized domination parametersMichael A. Henning, Henda C. Swart. DM, 120(1-3):93-105, 1993. [doi]

1992

Some nordhaus- gaddum-type resultsWayne Goddard, Michael A. Henning, Henda C. Swart. jgt, 16(3):221-231, 1992. [doi]

1980

Spanning cycles of nearly cubic graphsRoger C. Entringer, Henda C. Swart. JCT, 29(3):303-309, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL