Huanghun Bird's Nest is a family business that sells small-scale raw bird's nests (S.M.E.), which has been operating for 20 years in Banyuwangi. The development and growth of the Huanghun Bird's Nest are considered very slow, so the second generation started to develop the Huanghun Bird's Nest by producing finished swallow's nest products that can be directly consumed. This requires a special strategy that is suitable for a family business so that this business can successfully develop and survive. In Indonesia alone, 99% of family businesses are still classified as S.M.E.s. Hence the main objective of this study is to identify strategies to develop a small family business and make it sustainable. The mixed-method was chosen for this study to carry out an interpretive analysis of the subject. The collected data is used to explore internal and external environment analysis. The formulation stage uses internal and external analysis, which then forms a S.W.O.T. and then uses a T.O.W.S. analysis matrix to produce a suitable business strategy. In addition, the Ansoff Matrix was also carried out to find out what strategies will be used to develop this business. The goal of this research is to implement business development strategy to make Huanghun Bird's Nest developed and sustainable using market development strategy.

Let G = (V, E) be a simple undirected graph. A labeling f : V (G) → {1, . . . , k} is a local inclusive d-distance vertex irregular labeling of G if every adjacent vertices x, y ∈ V (G) have distinct weights, with the weight w(x), x ∈ V (G) is the sum of every labels of vertices whose distance from x is at most d. The local inclusive d-distance vertex irregularity strength of G, lidis(G), is the least number k for which there exists a local inclusive d-distance vertex irregular labeling of G. In this paper, we prove a conjecture on the local inclusive d-distance vertex irregularity strength for d = 1 for tree and we generalize the result for block graph using the clique number. Furthermore, we present several results for multipartite graphs and we also observe the relationship with chromatic number.

Let G = (V, E) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G. An edge magic total labeling on G is a bijection f :Such a labeling is said to be a super edge magic total labeling if f (V ) = {1, 2, . . . , |V |} and a b-edge consecutive edge magic total labeling if f (E) = {b + 1, b + 2, . . . , b + |E|} with b ≥ 1.In this research, we give sufficient conditions for a graph G having a super edge magic total labeling to have a b-edge consecutive edge magic total labeling. We also give several classes of connected graphs which have both labelings.