cover
Article Per Year (5 Year)
All
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
Indonesian Journal of Combinatorics
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 7 Documents
 1 
Search results for , issue "Vol 5, No 2 (2021)" : 7 Documents clear
On the Locating Chromatic Number of Barbell Shadow Path Graph A. Asmiati; Maharani Damayanti; Lyra Yulianti
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.4

Abstract

The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinality of the minimum color classes of the graph. In this paper, we discuss about the locating-chromatic number of shadow path graph and barbell graph containing shadow graph.
Relationship between adjacency and distance matrix of graph of diameter two Siti L. Chasanah; Elvi Khairunnisa; Muhammad Yusuf; Kiki A. Sugeng
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.1

Abstract

The relationship among every pair of vertices in a graph can be represented as a matrix, such as in adjacency matrix and distance matrix. Both adjacency and distance matrices have the same property. Adjacency and distance matrices are both symmetric matrix with diagonals entries equals to 0.  In this paper, we discuss relationships between adjacency matrix and distance matrix of a graph of diameter two, which is D=2(J-I)-A. From this relationship, we  also determine the value of the determinant matrix A+D and the upper bound of determinant of matrix D.
All unicyclic graphs of order n with locating-chromatic number n-3 Edy Tri Baskoro; Arfin Arfin
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.3

Abstract

Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (⩾ 6) and having locating-chromatic number n-3.
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4) Sabrina Shena Sarasvati; Ikhsanul Halikin; Kristiana Wijaya
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.5

Abstract

A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of path Pn and cycle on four vertices C4 or shadow of cycle of order four D2(C4) are odd harmonious.
On local antimagic vertex coloring of corona products related to friendship and fan graph Zein Rasyid Himami; Denny Riama Silaban
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.7

Abstract

Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u), we called it a local antimagic vertex coloring of G. A local antimagic chromatic number of G, denoted by χla(G), is the minimum number of colors taken over all colorings induced by the local antimagic labeling of G. In this paper, we determine the local antimagic chromatic number of corona product of friendship and fan with null graph on m vertices, namely, χla(Fn ⊙ \overline{K_m}) and χla(f(1,n) ⊙ \overline{K_m}).
The degree sequences of a graph with restrictions Rikio Ichishima; Francesc A. Muntaner-Batle; Miquel Rius-Font; Yukio Takahashi
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.2

Abstract

Two finite sequences s1 and s2 of nonnegative integers are called bigraphical if there exists a bipartite graph G with partite sets V1 and V2 such that s1 and s2 are the degrees in G of the vertices in V1 and V2, respectively. In this paper, we introduce the concept of 1-graphical sequences and present a necessary and sufficient condition for a sequence to be 1-graphical in terms of bigraphical sequences.
Structure of intersection graphs Haval M. Mohammed Salih; Sanaa M. S. Omer
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.6

Abstract

 Let G be a finite group and let N be a fixed normal subgroup of G.  In this paper, a new kind of graph on G, namely the intersection graph is defined and studied. We use  to denote this graph, with its vertices are all normal subgroups of G and two distinct vertices are adjacent if their intersection in N. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of  for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. 

Page 1 of 1 | Total Record : 7

 1 

Filter by Year

2021 2021


Reset
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