# Indonesian Combinatorial Society (InaCombS)

Learned society in Bandung, Indonesia

Mathematics Departement, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Depok, Jawa Barat 16424, Indonesia

# Indonesian Combinatorial Society (InaCombS)

Indonesian Combinatorial Society (InaCombS) was established on 6 May 2006 to facilitate, encourage, foster and cherish combinatorics development in Indonesia and improve the application of combinatorics to other disciplines.

InaCombS is a professional organization that is scientific, non-profit and independent. The organization is a forum for combinatorists and other enthusiasts who want to develop combinatorics in Indonesia. InaCombS is headquartered in Bandung, West Java.

Fields of study: Mathematics & Statistics

21–40 of 114 results.

• Thodoris Karatasos • Evi Papaioannou
• 2017
In this work, we present an innovative image recognition technique which is based on the exploitation of transit-data in images or simple photographs of sites of interest. Our objective is to automati...
• Anak Agung Gede Ngurah • Rinovia Simanjuntak
• 2017
A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy... • Bryan Freyberg • Melissa Keranen • 2017 The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph$\overrightarrow{G}=(V,A)$of order n is a bijection$\overrigh...
• Mustapha Aouchiche • Pierre Hansen
• 2017
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60--67] that $\eta \le n - D$, where $... • V. Yegnanarayanan • 2017 Let$p \ge 3$be a positive integer and let$k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as$V(GP(p, k)) = \{u_i : i \in Zp\} \cup...
• Kijung Kim
• 2017
In 2010, Kim, Park and Sano studied the competition numbers of Johnson graphs. They gave the competition numbers of J(n,2) and J(n,3).In this note, we consider the competition number of J(n,4).
• I. Nengah Suparta
• 2017
A Gray code of length n is a list of all binary words of length n such that each two successive codewords differ in only one bit position. If the first and the last codewords also share this property,...
• Mehdi Alaeiyan • Ayoob Mehrabani
• 2017
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A_...
• Faraha Ashraf • Martin Baca • Andrea Semanicova-Fenovcikova • Ayesha Shabbir
• 2017
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting H-covering admits an H-irregular...
• Suk J. Seo • Peter J. Slater
• 2017
A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any give...
• Amrita Acharyya • Jon M. Corson • Bikash Das
• 2017
We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions.The ...
• Hamed Ghasemian Zoeram • Daniel Yaqubi
• 2017
A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we ...
• Kamal Lochan Patra • Binod Kumar Sahoo
• 2017
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph ...
Let $(\Gamma,*)$ be a finite group and $S$ a possibly empty subset of $\Gamma$ containing its non-self-invertible elements. In this paper, we introduce the inverse graph associated with $\Gamma$ whose...
Here we denote a {\it diameter six tree} by $(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r})$, where $c$ is the center of the tree; $a_{i}, i = 1, 2, \ldo... • Keith Driscoll • Elliot Krop • Michelle Nguyen • 2017 For any integer$k>0$, a tree$T$is$k$-cordial if there exists a labeling of the vertices of$T$by$\mathbb{Z}_k$, inducing edge-weights as the sum modulo$k$of the labels on incident vertices ... • Nader Jafari Rad • 2017 A subset$X$of edges of a graph$G$is called an \textit{edgedominating set} of$G$if every edge not in$X$is adjacent tosome edge in$X$. The edge domination number$\gamma'(G)$of$G$is the mini... • Seyed Morteza Mirafzal • Ali Zafari • 2017 Let$\Gamma=Cay(\mathbb{Z}_n, S_k)$be the Cayley graph on the cyclic additive group$\mathbb{Z}_n(n\geq 4),$where$S_1=\{1, n-1\}$, \dots ,$S_k=S_ {k-1}\cup\{k, n-k\}$are the inverse-closed s... • Padmapriya P. • Veena Mathad • 2017 Let$G = (V,E)$be a simple connected graph. Theeccentric-distance sum of$G$is defined as$\xi^{ds}(G) =\ds\sum_{\{u,v\}\subseteq V(G)} [e(u)+e(v)] d(u,v)$, where$e(u)\$ %\dsis the eccentricity of th...