Bohdan Zelinka

Learn More
We deal with the graph operator Pow 2 defined to be the complement of the square of a graph: Pow 2 (G) = Pow 2 (G). Motivated by one of many open problems formulated in [6] we look for graphs that are 2-periodic with respect to this operator. We describe a class G of bipartite graphs possessing the above mentioned property and prove that for any m, n ≥ 6,(More)
The paper solves one problem by E. Prisner concerning the 2-distance operator T 2. This is an operator on the class C f of all finite undirected graphs. If G is a graph from C f , then T 2 (G) is the graph with the same vertex set as G in which two vertices are adjacent if and only if their distance in G is 2. E. Prisner asks whether the periodicity ≥ 3 is(More)