Browsing LSP-Conference Proceeding by Author "HALIKIN, Ikhsanul"

Now showing items 1-5 of 5

    • High Order Three-Steps Newton Raphson-like Schemes for Solving Nonlinear Equation Systems 

      FATAHILLAH, Rizki Multazamil; ARIF, M Ziaul; HIDAYAT, Rusli; KUSBUDIONO, Kusbudiono; HALIKIN, Ikhsanul (Advances in Computer Science Research, 2022-02-08)
      This study proposes several new 3-steps schemes based on the Newton-Raphson method for solving non-linear equation systems. The proposed schemes are analysed and formulated based on the Newton-Raphson method and the ...

    • L(2,1) Labeling of Lollipop and Pendulum Graphs 

      KUSBUDIONO, Kusbudiono; UMAM, Irham Af'idatul; HALIKIN, Ikhsanul; FATEKUROHMAN, Mohamat (Advances in Computer Science Research, 2022-02-08)
      One of the topics in graph labeling is 𝐿(2,1) labeling which is an extension of graph labeling. Definition of 𝐿(2,1) labeling is a function that maps the set of vertices in the graph to non-negative integers such that ...

    • Odd Harmonious Labeling of Two Graphs Containing Star 

      PUJIWATI, Diah Ayu; HALIKIN, Ikhsanul; WIJAYA, Kristiana (AIP Conference Proceedings, 2021-02-08)
      An odd harmonious labeling of a graph G is an injective function f : V (G) → {0,1,2,...,2|E(G)| − 1} such that the induced function f ∗ : E(G) → {1,3,...,2|E(G)| − 1} defined by f ∗(xy) = f (x) + f (y) is a bijection. A ...

    • On inclusive 1-Distance Vertex Irregularity Strength of Firecracker, Broom, and Banana Tree 

      HALIKIN, Ikhsanul; SAVITRI, Ade Rizky; WIJAYA, Kristiana (Proceedings of the International Conference on Mathematics and Islam, 2020-03-03)
      Let k be a natural number and G be a simple graph. An inclusive d-distance vertex irregular labelling of a graph G is a function 𝜆: 𝑉(𝐺) ⟶ {1,2, … , 𝑘} so that the weights at each vertex are different. Let v be a vertex ...

    • On inclusive distance vertex irregularity strength of small identical copies of star graphs 

      SUSANTO, Faisal; HALIKIN, Ikhsanul; WIJAYA, Kristiana; BETISTIYAN, C. N. (Journal of Physics: Conference Series, 2021-05-14)
      For a simple graph G, an inclusive distance vertex irregular k-labeling of G is a mapping λ : V (G) → {1, 2, . . . , k} such that all the vertex-weights are pairwise distinct, where the weight of a vertex v, denoted by ...