Перегляд за автором "Protasova, K.D."

Сортувати за: Порядок: Результатів:

  • Automorphisms of kaleidoscopical graphs 
    Protasov, I.V.; Protasova, K.D. (Algebra and Discrete Mathematics, 2007)
    A regular connected graph Γ of degree s is called kaleidoscopical if there is a (s + 1)-coloring of the set of its vertices such that every unit ball in Γ has no distinct monochrome points. The kaleidoscopical graphs can ...
  • On recurrence in G-spaces 
    Protasov, I.V.; Protasova, K.D. (Algebra and Discrete Mathematics, 2017)
    We introduce and analyze the following general concept of recurrence. Let G be a group and let X be a G-space with the action G×X⟶X, (g,x)⟼gx. For a family F of subset of X and A∈F, we denote ΔF(A)={g∈G:gB⊆A for some B∈F, ...
  • On square-Hamiltonian graphs 
    Protasova, K.D. (Algebra and Discrete Mathematics, 2005)
    A finite connected graph G is called squareHamiltonian if G² is Hamiltonian. We prove that any join of the family of Hamiltonian graphs by tree is square-Hamiltonian. Applying this statement we show that the line graph ...
  • Rainbow graphs and semigroups 
    Protasova, K.D.; Provotar, Т.М. (Доповіді НАН України, 2012)
    We give an algebraic characterization of rainbow graphs. A connected graph Γ is called rainbow if there is a vertex coloring of Γ, which is bijective on the set of neighbors of each vertex of Γ.
  • Recent progress in Subset Combinatorics of Groups 
    Protasov, I.V.; Protasova, K.D. (Український математичний вісник, 2017)
    We systematize and analyze some results obtained in Subset Combinatorics of G groups after publications the previous surveys [1–4]. The main topics: the dynamical and descriptive characterizations of subsets of a group ...