Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: path-graph

Sortuj według:

Ogranicz wyniki do:

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

Histories in path graphs

100%

Niepel L.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 2

345-357

For a given graph G and a positive integer r the r-path graph, $P_r(G)$, has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length r-1, and their union forms either a cycle or a path of length k+1 in G. Let $P^k_r(G)$ be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of $P^k_r(G)$. The k-history $P^{-k}_r(H)$ is a subgraph of G that is induced by all edges that take part in the recursive definition of H. We present some general properties of k-histories and give a complete characterization of graphs that are k-histories of vertices of 2-path graph operator.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Niepel L.

1 2007

Wyniki wyszukiwania

Histories in path graphs