Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: extremal graph

Sortuj według:

Ogranicz wyniki do:

Smallest Regular Graphs of Given Degree and Diameter

100%

Knor M.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 1

187-191

In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Pₘ-saturated bipartite graphs with minimum size

100%

Dudek A., Wojda A.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 2

197-211

A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Dudek A.

1 Knor M.

1 Wojda A.

1 2014

1 2004

Wyniki wyszukiwania

Smallest Regular Graphs of Given Degree and Diameter

Pₘ-saturated bipartite graphs with minimum size