Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: weight of a graph

Sortuj według:

Ogranicz wyniki do:

On Maximum Weight of a Bipartite Graph of Given Order and Size

100%

Horňák M., Jendrol’ S., Schiermeyer I.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 1

147-165

The weight of an edge xy of a graph is defined to be the sum of degrees of the vertices x and y. The weight of a graph G is the minimum of weights of edges of G. More than twenty years ago Erd˝os was interested in finding the maximum weight of a graph with n vertices and m edges. This paper presents a complete solution of a modification of the above problem in which a graph is required to be bipartite. It is shown that there is a function w*(n,m) such that the optimum weight is either w*(n,m) or w*(n,m) + 1.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Horňák M.

1 Jendrol’ S.

1 Schiermeyer I.

1 2013

Wyniki wyszukiwania

On Maximum Weight of a Bipartite Graph of Given Order and Size