Garuda - Garba Rujukan Digital

Article Per Year (5 Year)

All

Indonesian Journal of Combinatorics

ijc
Website

Published by Indonesian Combinatorial Society

ISSN : 25412205 EISSN : - DOI : -

Core Subject : Science,

Computer Science & IT Decision Sciences, Operations Research & Management

Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian Combinatorial Society (InaCombS), CGANT Research Group Universitas Jember (UNEJ), and Department of Mathematics Universitas Indonesia (UI).

Arjuna Subject : -

Articles 6 Documents

Search results for , issue "Vol 2, No 1 (2018)" : 6 Documents clear

Laplacian energy of trees with at most 10 vertices Masood Ur Rehman; Muhammad Ajmal; Tayyab Kamran
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Let Tn be the set of all trees with n ≤ 10 vertices. We show that the Laplacian energy of any tree Tn is strictly between the Laplacian energy of the path Pn and the star Sn, the authors partially proving that the conjecture hold for any tree Tn, where n ≤ 10.

Local antimagic vertex coloring of unicyclic graphs Nuris Hisan Nazula; S Slamin; D Dafik
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

The local antimagic labeling on a graph G with ∣V∣ vertices and ∣E∣ edges is defined to be an assignment f : E → {1, 2, ⋯, ∣E∣} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u) ≠ w(v) where w(u) = Σe ∈ E(u)f(e) and E(u) is the set of edges incident to u. Therefore, any local antimagic labeling induces a proper vertex coloring of G where the vertex u is assigned the color w(u). The local antimagic chromatic number, denoted by χla(G), is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, we present the local antimagic chromatic number of unicyclic graphs that is the graphs containing exactly one cycle such as kite and cycle with two neighbour pendants.

Four new operations related to composition and their reformulated Zagreb index K Pattabiraman; A Santhakumar
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

The first reformulated Zagreb index EM1(G) of a simple graph G is defined as the sum of the terms (du + dv − 2)2 over all edges uv of G. In 2017, Sarala et al. introduced four new operations(F-product) of graphs. In this paper, we study the first reformulated Zagreb index for the F-product of some special well-known graphs such as subdivision and total graph.

Further Results on Locating Chromatic Number for Amalgamation of Stars Linking by One Path A. Asmiati; Lyra Yulianti; C. Ike Tri Widyastuti
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Let G = (V, E) be a connected graph. Let c be a proper coloring using k colors, namely 1, 2, ⋯, k. Let Π = {S1, S2, ⋯, Sk} be a partition of V(G) induced by c and let Si be the color class that receives the color i. The color code, cΠ(v) = (d(v, S1), d(v, S2), ⋯, d(v, Sk)), where d(v, Si) = min{d(v, x)∣x ∈ Si} for i ∈ [1, k]. If all vertices in V(G) have different color codes, then c is called as the locating-chromatic k-coloring of G. Minimum k such that G has the locating-chromatic k-coloring is called the locating-chromatic number, denoted by χL(G). In this paper, we discuss the locating-chromatic number for n certain amalgamation of stars linking a path, denoted by nSk, m, for n ≥ 1, m ≥ 2, k ≥ 3, and k > m.

3-Difference cordial labeling of some path related graphs R Ponraj; M Maria Adaickalam; R Kala
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Let G be a (p, q)-graph. Let f : V(G) → {1, 2, …, k} be a map where k is an integer, 2 ≤ k ≤ p. For each edge uv, assign the label ∣f(u) − f(v)∣. f is called k-difference cordial labeling of G if ∣vf(i) − vf(j)∣ ≤ 1 and ∣ef(0) − ef(1)∣ ≤ 1 where vf(x) denotes the number of vertices labelled with x, ef(1) and ef(0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of triangular snake, alternate triangular snake, alternate quadrilateral snake, irregular triangular snake, irregular quadrilateral snake, double triangular snake, double quadrilateral snake, double alternate triangular snake, and double alternate quadrilateral snake.

Graceful labeling on torch graph Jona Martinus Manulang; Kiki A. Sugeng
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Let G be a graph with vertex set V = V(G) and edge set E = E(G). An injective function f : V → {0, 1, 2, ..., ∣E∣} is called graceful labeling if f induces a function f * (uv) = ∣f(u) − f(v)∣ which is a bijection from E(G) to the set {1, 2, 3, ..., ∣E∣}. A graph which admits a graceful labeling is called a graceful graph. In this paper, we show that torch graph On is a graceful graph.

Page 1 of 1 | Total Record : 6

Filter by Year

2018 2018

Filter By Issues

All Issue Vol 9, No 1 (2025) Vol 8, No 2 (2024) Vol 8, No 1 (2024) Vol 7, No 2 (2023) Vol 7, No 1 (2023) Vol 6, No 2 (2022) Vol 6, No 1 (2022) Vol 5, No 2 (2021) Vol 5, No 1 (2021) Vol 4, No 2 (2020) Vol 4, No 1 (2020) Vol 3, No 2 (2019) Vol 3, No 1 (2019) Vol 2, No 2 (2018) Vol 2, No 1 (2018) Vol 1, No 2 (2017) Vol 1, No 1 (2016) More Issue

Home Page

OAI Link

Editorial Team

Contact

Reviewer

Google Scholar

Contact Name
Slamin

Contact Email
slamin@unej.ac.id

Phone
-

Journal Mail Official
slamin@unej.ac.id

Editorial Address
-

Location
,

INDONESIA

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Home Page

OAI Link

Editorial Team

Contact

Reviewer

Google Scholar

Contact Name Slamin

Contact Email slamin@unej.ac.id

Phone -

Journal Mail Official slamin@unej.ac.id

Editorial Address -

Location , INDONESIA

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Contact Name
Slamin

Contact Email
slamin@unej.ac.id

Phone
-

Journal Mail Official
slamin@unej.ac.id

Editorial Address
-

Location
,

INDONESIA