|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | M. J. Morgan, Simon Mukwembi, Henda C. Swart |
A lower bound on the eccentric connectivity index of a graph.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | M. J. Morgan, Simon Mukwembi, Henda C. Swart |
On the eccentric connectivity index of a graph. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, Paul van den Berg |
The number of edges in a bipartite graph of given radius. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart |
The edge-Wiener index of a graph. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart |
Domination with exponential decay. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Simon Mukwembi, Henda C. Swart |
Average distance and vertex-connectivity. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart |
On the degree distance of a graph. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, Paul van den Berg |
Diameter and inverse degree. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Simon Mukwembi, Henda C. Swart |
Average Distance and Edge-Connectivity II. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Simon Mukwembi, Henda C. Swart |
Average Distance and Edge-Connectivity I. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, David P. Day |
On strong distances in oriented graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart |
MAD trees and distance-hereditary graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart |
Twin Domination in Digraphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart |
Augmenting trees so that every three vertices lie on a cycle. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart |
Multipartite Ramsey Numbers. |
Ars Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | David P. Day, Ortrud R. Oellermann, Henda C. Swart |
Bounds on the size of graphs of given order and up/down-connectivity. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart |
Generalized eccentricity, radius, and diameter in graphs. |
Networks |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart |
Bounds on the Total Redundance and Efficiency of a Graph. |
Ars Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Wayne Goddard, Michael D. Plummer, Henda C. Swart |
Maximum and minimum toughness of graphs of small genus. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Day, Ortrud Oellermann, Henda C. Swart |
A characterization of 3-Steiner distance hereditary graphs. |
Networks |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, Ortrud Oellermann |
On the Average Steiner Distance of Graphs with Prescribed Properties. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart |
Local edge domination critical graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart |
The diversity of domination. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Henda C. Swart |
Distances between graphs under edge operations. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart |
An Algorithm to Find Two Distance Domination Parameters in a Graph. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Day, Ortrud R. Oellermann, Henda C. Swart |
On the l-connectivity of a diagraph. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart |
Steiner distance stable graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Day, Ortrud Oellermann, Henda C. Swart |
Steiner Distance-Hereditary Graphs. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Henda C. Swart |
Bounds relating generalized domination parameters. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart |
Principal Common Divisors of Graphs. |
Eur. J. Comb. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Roger C. Entringer, Henda C. Swart |
Spanning cycles of nearly cubic graphs. |
J. Comb. Theory, Ser. B |
1980 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")