# 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:

71–80 of 114 results.

• Salman Ghazal
• 2015
Seymour's second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex i...
• Gholam Hassan Shirdel • Nasrin Kahkeshani
• 2015
The purpose of the independent set interdiction problem in the weighted graph $G$ is to determine a set of vertices $R^*$ such that the weight of the maximum independent set in $G-R^*$ is minimized. W...
• Anita Abildgaard Sillasen
• 2015
The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum out-degree d and diameter k. An upper bound is given by the Mo...
• Seyed Mahmoud Sheikholeslami • Lutz Volkmann
• 2015
Let $D$ be a finite and simple digraph with vertex set $V(D)$.A {\em signed Roman dominating function} on the digraph $D$ isa function $f:V (D)\longrightarrow \{-1, 1, 2\}$ such that$\sum_{u\in N^-[v... • Hilal A. Ganie • Shariefuddin Pirzada • Edy Tri Baskoro • 2015 For a graph$G$having adjacency spectrum ($A$-spectrum)$\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$and Laplacian spectrum ($L$-spectrum)$0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy... • Jemal Abawajy • Andrei Kelarev • Joe Ryan • 2015 The present article continues the investigation of visible ideal bases in constructions defined using directed graphs. This notion is motivated by its applications for the design of classication syste... • Jeremy Moody • P. K. Aravind • 2015 This paper shows how a method developed by Van Steenwijk can be generalized to calculate the resistance between any two vertices of a symmetrical polytope all of whose edges are identical resistors. T... • Xueliang Li • Yongtang Shi • Martin Trinks • 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a gr... • Christian Rubio Montiel • 2015 A graph$G$is \emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number)$\alpha(G)$equals the number of (maxim... • Harishchandra S. Ramane • Ashwini S. Yalnaik • 2015 The reciprocal complementary distance (RCD) matrix of a graph$G$is defined as$RCD(G) = [rc_{ij}]$where$rc_{ij} = \frac{1}{1+D-d_{ij}}$if$i \neq j$and$rc_{ij} = 0$, otherwise, where$D\$ is the...
per halaman