UB Paderborn / Katalog / Suche / in CDI

Eccentric counts, connectivity and chordality

Information processing letters, 2012-12, Vol.112 (24), p.944-947

2012

Volltextzugriff (PDF)

Diameter and inverse degree

Discrete mathematics, 2008-03, Vol.308 (5), p.670-673

2008

Volltextzugriff (PDF)

Average Distance and Edge-Connectivity I

SIAM journal on discrete mathematics, 2008-01, Vol.22 (1), p.92-101

2008

Volltextzugriff (PDF)

AVERAGE DISTANCE AND EDGE-CONNECTIVITY II

SIAM journal on discrete mathematics, 2008-01, Vol.21 (4), p.1035-1052

2008

Volltextzugriff (PDF)

The number of edges in a bipartite graph of given radius

Discrete mathematics, 2011-05, Vol.311 (8), p.690-698

2011

Volltextzugriff (PDF)

On equality in an upper bound for the restrained and total domination numbers of a graph

Discrete mathematics, 2007-10, Vol.307 (22), p.2845-2852

2007

Volltextzugriff (PDF)

Trees with Equal Domination and Restrained Domination Numbers

Journal of global optimization, 2006-04, Vol.34 (4), p.597-607

2006

Volltextzugriff (PDF)

Maximum sizes of graphs with given domination parameters

Discrete mathematics, 2004-04, Vol.281 (1), p.137-148

2004

Volltextzugriff (PDF)

Domination with exponential decay

Discrete mathematics, 2009-10, Vol.309 (19), p.5877-5883

2009

Volltextzugriff (PDF)

On strong distances in oriented graphs

Discrete mathematics, 2003-05, Vol.266 (1), p.195-201

2003

Volltextzugriff (PDF)

Average distance and vertex-connectivity

Journal of graph theory, 2009-10, Vol.62 (2), p.157-177

2009

Volltextzugriff (PDF)

A NOTE ON EXTREMAL VALUES OF THE SCATTERING NUMBER

Taiwanese journal of mathematics, 2013-10, Vol.17 (5), p.1651-1658

2013

Volltextzugriff (PDF)

Augmenting trees so that every three vertices lie on a cycle

Discrete Applied Mathematics, 2002-01, Vol.116 (1), p.145-159

2002

Volltextzugriff (PDF)

AVERAGE DISTANCE AND EDGE-CONNECTIVITY I

SIAM journal on discrete mathematics, 2009, Vol.22 (1), p.92-101

2009

Volltextzugriff (PDF)

Domination with exponential decay: Structural Graph Theory Dedicated to Professor Gary Chartrand in Honor of his 70th Birthday

Discrete mathematics, 2009, Vol.309 (19), p.5877-5883

2009

Volltextzugriff (PDF)

Steiner Distance-Hereditary Graphs

SIAM journal on discrete mathematics, 1994-05, Vol.7 (3), p.437-442

1994

Volltextzugriff (PDF)

Maximum and minimum toughness of graphs of small genus

Discrete mathematics, 1997-04, Vol.167, p.329-339

1997

Volltextzugriff (PDF)

On the average Steiner distance of graphs with prescribed properties

Discrete Applied Mathematics, 1997-11, Vol.79 (1), p.91-103

1997

Volltextzugriff (PDF)

Distances between graphs under edge operations

Discrete mathematics, 1996-12, Vol.161 (1), p.121-132

1996

Volltextzugriff (PDF)

The average Steiner distance of a graph

Journal of graph theory, 1996-05, Vol.22 (1), p.15-22

1996

Volltextzugriff (PDF)

Bounds on the size of graphs of given order and [formula omitted]-connectivity

Discrete mathematics, 1999, Vol.197, p.217-223

1999

Volltextzugriff (PDF)

Bounds on the size of graphs of given order and l-connectivity

Discrete mathematics, 1999-02, Vol.197-198, p.217-223

1999

Volltextzugriff (PDF)

Generalized eccentricity, radius, and diameter in graphs

Networks, 1999-12, Vol.34 (4), p.312-319

1999

Volltextzugriff (PDF)

The diversity of domination

Discrete mathematics, 1996-12, Vol.161 (1), p.161-173

1996

Volltextzugriff (PDF)

Steiner distance stable graphs

Discrete mathematics, 1994-09, Vol.132 (1), p.65-73

1994

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Eccentric counts, connectivity and chordality

Diameter and inverse degree

Average Distance and Edge-Connectivity I

AVERAGE DISTANCE AND EDGE-CONNECTIVITY II

The number of edges in a bipartite graph of given radius

On equality in an upper bound for the restrained and total domination numbers of a graph

Trees with Equal Domination and Restrained Domination Numbers

Maximum sizes of graphs with given domination parameters

Domination with exponential decay

On strong distances in oriented graphs

Average distance and vertex-connectivity

A NOTE ON EXTREMAL VALUES OF THE SCATTERING NUMBER

Augmenting trees so that every three vertices lie on a cycle

AVERAGE DISTANCE AND EDGE-CONNECTIVITY I

Domination with exponential decay: Structural Graph Theory Dedicated to Professor Gary Chartrand in Honor of his 70th Birthday

Steiner Distance-Hereditary Graphs

Maximum and minimum toughness of graphs of small genus

On the average Steiner distance of graphs with prescribed properties

Distances between graphs under edge operations

The average Steiner distance of a graph

Bounds on the size of graphs of given order and [formula omitted]-connectivity

Bounds on the size of graphs of given order and l-connectivity

Generalized eccentricity, radius, and diameter in graphs

The diversity of domination

Steiner distance stable graphs

Suchergebnisse filtern