# 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

31–40 of 114 results.

• Thodoris Karatasos • Evi Papaioannou
Electronic Journal of Graph Theory and Applications • 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...
• I. Nengah Suparta
Electronic Journal of Graph Theory and Applications • 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,...
• V. Yegnanarayanan
Electronic Journal of Graph Theory and Applications • 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 Electronic Journal of Graph Theory and Applications • 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). • Faraha Ashraf • Martin Baca • Andrea Semanicova-Fenovcikova • Ayesha Shabbir Electronic Journal of Graph Theory and Applications • 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 Electronic Journal of Graph Theory and Applications • 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... • Steven Schluchter • J. Z. Schroeder Electronic Journal of Graph Theory and Applications • 2017 A proper embedding of a graph G in a pseudosurface P is an embedding in which the regions of the complement of G in P are homeomorphic to discs and a vertex of G appears at each pinchpoint in P; we s... • Mustapha Aouchiche • Pierre Hansen Electronic Journal of Graph Theory and Applications • 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$...
• Mehdi Alaeiyan • Ayoob Mehrabani
Electronic Journal of Graph Theory and Applications • 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_...