Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Edge-ordering

Sortuj według:

Ogranicz wyniki do:

Altitude of wheels and wheel-like graphs

100%

Dzido T., Furmańczyk H.

Open Mathematics

2010

tom 8

nr 2

319-326

An edge-ordering of a graph G=(V, E) is a one-to-one mapping f:E(G)→{1, 2, ..., |E(G)|}. A path of length k in G is called a (k, f)-ascent if f increases along the successive edges forming the path. The altitude α(G) of G is the greatest integer k such that for all edge-orderings f, G has a (k, f)-ascent. In our paper we give exact values of α(G) for all helms and wheels. Furthermore, we use our result to obtain altitude for graphs that are subgraphs of helms.

Ograniczanie wyników

1 Open Mathematics

1 Dzido T.

1 Furmańczyk H.

1 2010

Wyniki wyszukiwania

Altitude of wheels and wheel-like graphs