# 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

41–50 of 114 results.

• Amrita Acharyya • Jon M. Corson • Bikash Das
Electronic Journal of Graph Theory and Applications • 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
Electronic Journal of Graph Theory and Applications • 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
Electronic Journal of Graph Theory and Applications • 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 ...
• Anak Agung Gede Ngurah • Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications • 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 Electronic Journal of Graph Theory and Applications • 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...
A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V... • Salman Fawzi Ghazal Electronic Journal of Graph Theory and Applications • 2016 Let$D$be a digraph without digons. Seymour's second neighborhood conjecture states that$D$has a vertex$v$such that$d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for di... • David J. Aldous Electronic Journal of Graph Theory and Applications • 2016 Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\em routes} rather than {\em edges} as primitives. This artic... • Christian Barrientos • Sarah M. Minion Electronic Journal of Graph Theory and Applications • 2016 In this paper we study a technique to transform$\alpha $-labeled trees into$\rho $-labeled forests. We use this result to prove that the complete graph$K_{2n+1}\$ can be decomposed into these types...