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 5 Documents
 1 
Search results for , issue "Vol 9, No 2 (2025)" : 5 Documents clear
Outer multiset dimension of joined graphs Pervaiz, Hassan; Simanjuntak, Rinovia; Saputro, Suhadi Wido
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

The outer multiset dimension of graph G, dimms(G), is the cardinality of the smallest subset S of vertices that uniquely recognizes each vertex outside S by using the multiset of distances between the vertex and the vertices in S. In 2023, Klavzar, Kuziak, and Yero proved that the only graphs with the largest outer multiset dimension, that is, one less than their order, are regular graphs of diameter at most 2. This paper considers the outer multiset dimensions of non-regular graphs of diameter 2 obtained from the join product, in particular, stars, wheels, generalized wheels, windmills, fans, and generalized fans. 
On interior Roman domination in graphs Casinillo, Leomarich F.
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Let G = (V(G), E(G)) be a non-complete graph and let ϕ:V(G)→{0,1,2} be a function on G. For each i ∈ {0, 1, 2}, let Vi={w ∈ V(G): ϕ(w)=i}.  A function ϕ=(V0, V1, V2) is an interior Roman dominating function (InRDF) on G if (i) for every v ∈ V0, there exists u ∈ V2 such that uv ∈ E(G), and (ii) either V1=V(G) or for every z ∈ V2, z is an interior vertex of G.  Denoted by  ωGInR(ϕ)=∑u ∈ V(G) ϕ(u) is the weight of InRDF ϕ; and the minimum weight of an InRDF ϕ on G, denoted by γInR(G), is called the interior Roman domination number. Any InRDF ϕ on graph G with ωGInR(ϕ)= γInR(G) is called a γInR -function on G. In this paper, we introduce a new parameter of a Roman dominating function in graphs and discuss some important combinatorial properties.  
The partition dimension of origami graphs and its barbell Fakhira, Luthfia Ayu; Hadi, Nur Wafiqoh; Asmiati, A.; Nurvazly, Dina Eka
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

The origami graph, On, n≥3, is a graph formed by a central cycle with origami folds, where each fold consists of two C3 cycles. The barbell origami graph, BOn for n≥3 is obtained by copying a On and connecting two graphs with a bridge. In this research, we determined the partition dimension of the origami graphs and its barbell.
Sum rules for permutations with fixed points involving Stirling numbers of the first kind Pain, Jean-Christophe
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

We propose sum rules for permutations pn(k) of the ensemble {1,2,...,n} with k fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind s(q,r). Using a formula due to Vassilev-Missana and the Schlomlich expression of Stirling numbers, we also deduce sum rules for binomial coefficients. Connections with Bell numbers Bn are outlined.
Local edge antimagic chromatic number of join product of graphs Maryati, Tita Khalis; Hadiputra, Fawwaz Fakhrurrozi
Indonesian Journal of Combinatorics Vol 9, No 2 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Let f : V(G) \to [1,|V(G)|] be a bijective mapping of the vertex set of a graph G to the integers 1 through |V(G)|. A labeling f is defined as a local edge antimagic labeling if, for any two adjacent edges uv and vx in E(G), their weights satisfy wf(uv) ≠ wf(vx), where the weight of an edge uv is given by wf(uv) = f(u) + f(v). The weight wf induces a proper edge coloring on G. The local edge antimagic chromatic number of G, denoted χlea'(G), is the minimum number of colors required among all colorings induced by local edge antimagic labelings of G. In this paper, we investigate the local edge antimagic coloring of join product of graphs, particularly for independent sets, paths, and cycles.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2025 2025


Reset
Filter By Issues
All Issue Vol 9, No 2 (2025) 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