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 75 Documents
 3   4   5   6   7 
Randomness of encryption keys generated by super H-antimagic total labeling Antonius Cahya Prihandoko; Yudha Alif Auliya; Diksy Media Firmansyah; S Slamin
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

SuperH-antimagic total labeling (SHATL) can be utilized to generate encryption keys. The keys are then used to establish the improved block and stream ciphers. In these ciphers, different blocks were encrypted by the different keys, but all block keys were connected one another. These conditions make the developed cryptosystems more secure and require less keys storage capacity compared to the ordinary block and stream cipher. The randomness of the generated keys, however, still need to be tested. The test is necessary to ensure that there is no specific pattern that can be utilized by any intruder to guess the keys. This paper presents the randomness tests applied to all key sequences generated by both the improved block scheme and the stream based scheme.
On locating-dominating number of comb product graphs Aswan Anggun Pribadi; Suhadi Wido Saputro
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (171.715 KB) | DOI: 10.19184/ijc.2020.4.1.4

Abstract

We consider a set D ⊆ V(G) which dominate G and for every two distinct vertices x, y ∈ V(G) \ D, the open neighborhood of x and y in D are different. The minimum cardinality of D is called the locating-dominating number of G. In this paper, we determine an exact value of the locating- dominating number of comb product graphs of any two connected graphs of order at least two.
Triangles in the suborbital graphs of the normalizer of $\Gamma_0(N)$ Nazlı Yazıcı Gözütok; Bahadır Özgür Güler
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

In this paper, we investigate a suborbital graph for the normalizer of Γ0(N) ∈ PSL(2;R), where N will be of the form 24p2 such that p > 3 is a prime number. Then we give edge and circuit conditions on graphs arising from the non-transitive action of the normalizer.
Edge irregular reflexive labeling on sun graph and corona of cycle and null graph with two vertices Irfan Setiawan; Diari Indriati
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke} assignment to edges of graph and the even positive integer {0,2,4,...,2kv} assignment to vertices of graph. Then, we called as edge irregular reflexive k-labelling if every edges has different weight with k = max{ke,2kv}. Besides that, there is definition of reflexive edge strength of G(V,E) denoted as res(G), that is a minimum k that using for labeling f on G(V,E). This paper will discuss about edge irregular reflexive k-labeling for sun graph and corona of cycle and null graph, denoted by Cn ⨀ N2 and make sure about their reflexive edge strengths.
The total disjoint irregularity strength of some certain graphs Meilin I Tilukay; A. N. M. Salman
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Under a totally irregular total k-labeling of a graph G = (V,E), we found that for some certain graphs, the edge-weight set W(E) and the vertex-weight set W(V) of G which are induced by k = ts(G), W(E) ∩ W(V) is a non empty set. For which k, a graph G has a totally irregular total labeling if W(E) ∩ W(V) = ∅? We introduce the total disjoint irregularity strength, denoted by ds(G), as the minimum value k where this condition satisfied. We provide the lower bound of ds(G) and determine the total disjoint irregularity strength of cycles, paths, stars, and complete graphs.
Some degree-based topological indices of triphenylene polyester Muge Togan; Aysun Yurttas Gunes; Musa Demirci; Ismail Naci Cangul
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Molecules can be modelled by graphs to obtain their required properties by means of only mathematical methods and formulae. In this paper, several degree-based graph indices of one of the important chemical compounds called as polyester are calculated to determine several chemical and physicochemical properties of polyester.
On (a,d)-antimagic labelings of Hn, FLn and mCn Ramalakshmi Rajendran; K. M. Kathiresan
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic. Also we prove that F Ln has no ((n+1)/2,4)- antimagic labeling.
Total edge irregularity strength of some cycle related graphs Ramalakshmi Rajendran; Kathiresan KM
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any two different edges uv and u'v', their weights f(u)+f(uv)+f(v) and f(u')+f(u'v')+f(v') are distinct. The total edge irregularity strength tes(G) is defined as the minimum k for which the graph G has an edge irregular total k-labeling. In this paper, we determine the total edge irregularity strength of new classes of graphs Cm @ Cn, Pm,n* and Cm,n* and hence we extend the validity of the conjecture tes(G) = max {⌈|E(G)|+2)/3⌉, ⌈(Δ(G)+1)/2⌉}  for some more graphs.
New families of star-supermagic graphs Anak Agung Gede Ngurah
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

A simple graph G admits a K1,n-covering if every edge in E(G) belongs to a subgraph of G isomorphic to K1,n. The graph G is K1,n-supermagic if there exists  a bijection f : V(G) ∪ E(G) → {1, 2, 3,..., |V(G) ∪ E(G)|} such that for every subgraph H' of G isomorphic to K1,n,  ∑v ∈ V(H')  f(v) + ∑e ∈ E(H') f(e) is  a constant and f(V(G)) = {1, 2, 3,..., |V(G)|}. In such a case, f is called a K1,n-supermagic labeling of G.  In this paper, we give a method how to construct K1,n-supermagic graphs from the old ones.
On Super (a,d)-edge antimagic total labeling of branched-prism graph Khairannisa Al Azizu; Lyra Yulianti; Narwen Narwen; Syafrizal Sy
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative integer d.

Page 5 of 8 | Total Record : 75

 3   4   5   6   7 

Filter by Year

2016 2023


Reset
Filter By Issues
All Issue 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