Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: leap

Sortuj według:

Ogranicz wyniki do:

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

Leaps: an approach to the block structure of a graph

100%

Mulder H., Nebeský L.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 1

77-90

To study the block structure of a connected graph G = (V,E), we introduce two algebraic approaches that reflect this structure: a binary operation + called a leap operation and a ternary relation L called a leap system, both on a finite, nonempty set V. These algebraic structures are easily studied by considering their underlying graphs, which turn out to be block graphs. Conversely, we define the operation $+_G$ as well as the set of leaps $L_G$ of the connected graph G. The underlying graph of $+_G$, as well as that of $L_G$, turns out to be just the block closure of G (i.e., the graph obtained by making each block of G into a complete subgraph).

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Mulder H.

1 Nebeský L.

1 2006

Wyniki wyszukiwania

Leaps: an approach to the block structure of a graph