7 research outputs found
The generalized 4-connectivity of burnt pancake graphs
The generalized -connectivity of a graph , denoted by , is
the minimum number of internally edge disjoint -trees for any and . The generalized -connectivity is a natural extension of
the classical connectivity and plays a key role in applications related to the
modern interconnection networks. An -dimensional burnt pancake graph
is a Cayley graph which posses many desirable properties. In this paper, we try
to evaluate the reliability of by investigating its generalized
4-connectivity. By introducing the notation of inclusive tree and by studying
structural properties of , we show that for , that is, for any four vertices in , there exist () internally
edge disjoint trees connecting them in
Teacher roles during amusement park visits – insights from observations, interviews and questionnaires
Amusement parks offer rich possibilities for physics learning, through observations and experiments that illustrate important physical principles and often involve the whole body. Amusement parks are also among the most popular school excursions, but very often the learning possibilities are underused. In this work we have studied different teacher roles and discuss how universities, parks or event managers can encourage and support teachers and schools in their efforts to make amusement park visits true learning experiences for their students