Search

Tourism is the activity of temporarily moving people to destinations outside their place of residence and place of work and carrying out activities while at the destination as well as preparing facilities to meet their needs. The definition of tourism will never be precise among experts. Basically tourism is travel with the aim of entertaining which is carried out outside the daily activities carried out in order to provide benefits that are permanent or temporary. In Indonesia, the tourism sector is one of the supports for the country's economy, where Indonesia is a country that has natural beauty and cultural diversity so that it becomes an attraction for tourists to travel to Indonesia. In the current pandemic situation, tourism companies are also affected by the pandemic, including the Java Wisata company. Reporting from the Java Wisata website, the Java Wisata company itself is an official and licensed travel agency domiciled in Bandung. Java Wisata provides a choice of domestic and foreign tour packages, for domestic one of them is a tour package to Pangalengan tourist attractions in South Bandung, then for domestic tour packages Java Wisata provides tour packages to Malaysia. Java Wisata Tour Bandung not only provides tour packages, but we also provide meeting packages and adventure packages in Bandung. The RPD Rich Picture Diagram is an ideal tool for communicating complex problem situations. RPD shows the overall situation in one picture. In addition, RPD is also a modeling tool that depicts cartoons to describe the entire complex system so that it is easy to read from all points of view.

As defined ingraph theory, the girth of a given graph is the length of its shortest cycle. Most of the papers, that mentioned the girth of a graph, I will mention here[1, 2, 3 and 4], investigated other features when the girth was one of the data, or described algorithms to find the girth when the graph is given. The purpose of this paper is to give inequalities, which explains girth’s relationship with the number of edges, the number of vertices and the number of faces, in a planar and connected graph.

Let be a real-valued and atwice-differentiablefunction in the interval, letso , then there is a point, in which. (This particular case is true according to [3]).The first purpose of this article is to generalize this particular case. Let be a real-valued and a twice-differentiablefunction in the interval, and let , then there is a point, inwhich. (This particular case is true according to [4]). The second purpose of this article is to generalize this particular case too. Let be a real-valued and a continuous functionin the interval, and let, and , then there is a pointsuch that. (This particular case is true according to [2]). The third purpose of this article is to generalize this particular case too.

isometry provided d ≥ 5. (The rational analogues of Beckman- Quarles theorem, due to W.hibi [8], [9]).The proof was based on the fact that has been proven: an auxiliary Lemma which ensures that:dim (aff(f(L[d])))= d, For all the dimensions d, d ≥ 5.When L[d] the set of Points in Qd in which precisely two non-zero coordinates are equal to 1/2 or -1/2. Here, in this paper,we are going to prove the same resultusing the fact (due toJ.Zaks [11]), that every mappingfrom Qd into Qd that preserves the distances 1 and is an isometry, provided ≥5.

It is known that any graph with six vertices cannot be isomorphic to its complement [3].V. K. Balakrishnan has written in his book Schaum’s solved problems series [1] the following: “Given two arbitrary Simple graphs of the same order and the same size, the problem of determining whetheran isomorphism exists between the two is known as the isomorphism problem in graph theory. In general, itis not all easy (in other words, there is no "efficient algorithm") to solve an arbitrary instance of the isomorphismproblem”, from here came the idea of this paper. As mentioned,isomorphism between two graphs G_1and G_2 is a one-valued function that copies the vertices of graph G_1over all the vertices of graphG_2. If two vertices connected on edge in graphG_1, their imageswill connected on edge in graphG_2;also, if two vertices are not connected in edge on graph G_1 so their images will also not be connected in edge also on graphG_2.The complementary graph of graph G and which will be marked with G ̅, is defined as the graph that contains the same set of vertices, and two vertices connected on edge in graph G will be connected on edge in graph G ̅, and two non-connected vertices on edge in graph G will be non-connected vertices on edge in graphG ̅. The purpose of this paper is to present anenough condition on the vertex number of a given graph so that it is not isomorphic to its complement.

Beckman, F.S and Quarles D.A, have proven in [1], the following theorem: Each function from the d-Euclidean space, (d≥2) into itself and which maintains distance 1 is an isometry. In addition,in [7, 8, [I had proven the parallel theoremfor rational spaces to the previous theorem, namely: every mapping from d-rational into itself, and which maintains distance 1 is an isometry provided d ≥ 5. Furthermore, in[6], I had proven: If d ≥ 5, and if, ω (d) = ω (d+1),then every unit- distance preserving mappingQdinto Qd+1 is an isometry, add to that,gave a form for the dimension for which Here in this article, I will expand one last result to show that in some special dimensiond, every unit distance-preserving mapping is an isometry. In addition, which are the dimension for which?

Beckman, F.S and Quarles D.A, have proven in [1], the following theorem: Each function from the d-Euclidean space, (d≥2) into itself and which maintains distance 1 is an isometry. In addition,in [7, 8, [I had proven the parallel theoremfor rational spaces to the previous theorem, namely: every mapping from d-rational into itself, and which maintains distance 1 is an isometry provided d ≥ 5. Furthermore, in[6], I had proven: If d ≥ 5, and if, ω (d) = ω (d+1),then every unit- distance preserving mappingQdinto Qd+1 is an isometry, add to that,gave a form for the dimensionfor which Here in this article, I will expand one last result to show that in some special dimensiond, every unit distance-preserving mapping is an isometry. In addition, which are the dimension for which?

BB-2208 Human Resource Management 2nd Individual Assignment Case Study Report