# 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–30 of 114 results.

A {\em retracting-free bidirectional circuit} in a graph $G$ is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the oppos...
For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two vertices of $D^{k}G$ are adjacent if they are exactly distance $k$ apart in the original graph $G$. ...
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 Electronic Journal of Graph Theory and Applications • 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 ... • Denny Riama Silaban • Edy Tri Baskoro • Saladin Uttunggadewa Electronic Journal of Graph Theory and Applications • 2017 Let$G$and$H$be simple graphs. The Ramsey number for a pair of graph$G$and$H$is the smallest number$r$such that any red-blue coloring of edges of$K_r$contains a red subgraph$G$or a blue s... • Anie Lusiani • Edy Tri Baskoro • Suhadi Wido Saputro Electronic Journal of Graph Theory and Applications • 2017 Let$K_{l\times t}$be a complete, balanced, multipartite graph consisting of$l$partite sets and$t$vertices in each partite set. For given two graphs$G_1$and$G_2$, and integer$j\geq 2$, the si... • Alain Valette Electronic Journal of Graph Theory and Applications • 2017 For a finite connected graph$X$, we consider the graph$RX$obtained from$X$by associating a new vertex to every edge of$X$and joining by edges the extremities of each edge of$X$to the correspo... • Padmapriya P. • Veena Mathad Electronic Journal of Graph Theory and Applications • 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... • K. Pravas • A. Vijayakumar Electronic Journal of Graph Theory and Applications • 2017 The Gallai and the anti-Gallai graphs of a graph$G$are complementary pairs of spanning subgraphs of the line graph of$G\$. In this paper we find some structural relations between these graph classes...