Analisis Strategi Pemasaran Marketing Mix untuk Meningkatkan Penjualan Pada D’Besto Fried Chicken Pekanbaru

Marketing strategy is an effort to market a product, both in the form of goods and services, using certain plans and tactics to increase sales volume. One of the business development strategies is the implementation of a marketing mix strategy. Marketing is one of the most important factors in the continuity of a business, so it is very important for business people to pay attention to the marketing mix in their business. The purpose of this study was to determine how D'besto Fried Chicken Pekanbaru applies sales promotion. The data analysis technique used is market mix analysis. The marketing mix variables studied were product, price, place and promotion. The results of this study indicate that consumer decisions in purchasing D'besto Fried Chicken Pekanbaru are strategic location selection and products that are acceptable to the public. The recommendation of this research is that D'besto Fried Chicken Pekanbaru products should be more diverse and innovative in terms of packaging and online marketing and improve brand quality.

On Irregular Total Labelings

A labeling of a graph is a map that carries graph elements to the numbers (usually positive or non-negative integers). The most common choices of domain are the set of all vertices (vertex labelings), the edge set alone (edge labelings), or the set of all vertices and edges (total labelings). In many cases, it is interesting to consider the sum of all labels associated with a graph element. It is called the weight of the element: the weight of a vertex or the weight of an edge. In this thesis, we consider a total k-labeling as a labeling of the vertices and edges of graph G with labels from the set {1, 2, . . . , k}. A total k-labeling is defined to be an edge irregular total k-labeling of the graph G if edge-weights are different for all pairs of distinct edges and to be a vertex irregular total k-labeling of G if vertex-weights are different for all pairs of distinct vertices. The minimum value of k for which the graph G has an edge irregular total k- labeling is called the total edge irregularity strength of the graph G, tes(G). Analo- gously, the total vertex irregularity strength of G, tvs(G), is defined as the minimum k for which there exists a vertex irregular total k-labeling of G. In this thesis, we present new results on the total edge irregularity strength and the total vertex irregularity strength.