Under the covid-19 pandemic, the profitability of the hotels will decrease, and the costs of the buffets will increase. It is essential to implement more efficient processes, while ensuring the safety of guests. The purpose of this study is to understand the future of hotel buffets amidst the COVID-19 pandemic. Four professionals from the Accor group were interviewed. They were purposefully chosen, due to their know-how in the F&B department. These professionals provided key recommendations and predictions on how hotels can adjust the buffet to a new reality. Their recommendations range from the transformation of the traditional buffet into an assisted buffet, to the implementation of new techniques to enhance the customer experience, and the growth of a healthy trend. The implementation of more efficient processes will also be essential for economic recovery. According to these professionals, the main challenge will be to generate a feeling of trust among customers.

No abstract

A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that face. In this paper, first we construct an upper bound for the paprmeter d. Secondly, we show that if a plane graph G is super d-antimagic then its subdivision is also super d-antimagic. Finally, we show that the Dutch windmill graph exist super d-antimagic labeling for different values of d, s.

A subset S of V G is called a total dominating set of a graph G if every vertex in V G is adjacent to a vertex in S . The total domination number of a graph G denoted by γ t G is the minimum cardinality of a total dominating set in G . The maximum order of a partition of V G into total dominating sets of G is called the total domatic number of G and is denoted by d t G . Domination in graphs has applications to several fields. Domination arises in facility location problems, where the number of facilities (e.g., hospitals and fire stations) is fixed, and one attempts to minimize the distance that a person needs to travel to get to the closest facility. In this paper, the numerical invariants concerning the total domination are studied for generalized Petersen graphs.