# Indonesian Combinatorial Society (InaCombS)

Learned society di 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.

Bidang studi: Mathematics & Statistics

Jurnal yang diterbitkan oleh InaCombS:

31–40 of 114 results.

• 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 ...
• Radosław Cymer
• 2017
In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings ...
• Monther Rashed Alfuraidan • Yusuf F. Zakariya
• 2017
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...
• Debdas Mishra • Sushant Kumar Rout • Puma Chandra Nayak
• 2017
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...
per halaman