Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

1 2007

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Randomly kCn graphs

Híc P., Pokorný M.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

2007

Vol. 12

41-48

A graph G is said to be a randomly H graph if and only if any subgraph of G without isolated vertices, which is isomorphic to a subgraph of H, can be extended to a subgraph H1 of G such that H1 is isomorphic to H. The problem of characterization of randomly H graphs, where H is r-regular graph on p vertices, was given by Tomasta and Tomová. In general, the characterization of such graphs seems to be difficult. However, there exist several results for the case r = 2. Chartrand, Oellermann, and Ruiz characterized randomly Cn graphs. Híc and Pokorný characterized randomly 2Cn graphs, as well as randomly Cn U Cm graphs, where n ≠ m. In this paper, the problem of randomly H graphs, where H = kCn , k > 2 is discussed.