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

61–70 of 114 results.

• Shariefuddin Pirzada • Hilal A. Ganie • Merajuddin Siddique
• 2016
For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\{u\in S : uv \in E... • Richard M. Low • W. H. Chan • 2016 The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this pap... • Ebrahim Vatandoost • Fatemeh Ramezani • 2016 Let$R$be a commutative ring (with 1) and let$Z(R)$be its set of zero-divisors. The zero-divisor graph$\Gamma(R)$has vertex set$Z^*(R)=Z(R) \setminus \lbrace0 \rbrace$and for distinct$x,y \in ...
• Chula Janak Jayawardene • Edy Tri Baskoro • Lilanthi Samarasekara • Syafrizal Sy
• 2016
For simple graphs $G_1$ and $G_2$, the size Ramsey multipartite number $m_j(G_1, G_2)$ is defined as the smallest natural number $s$ such that any arbitrary two coloring of the graph $K_{j \times s}$ ...
• J. Vernold Vivin • K. Kaliraj
• 2016
The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this paper we obtain interesting results regarding the equitable chromatic number $\chi_{=}$ for the corona grap...
• Colton Magnant • Pouria Salehi Nowbandegani • Hua Wang
• 2015
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of t...
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)... • Shariefuddin Pirzada • Muhammad Ali Khan • Zhou Guofei • Koko K. Kayibi • 2015 A$k$-hypertournament is a complete$k$-hypergraph with each$k$-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a$k$-hypertournament, the sc... • P. Anusha Devi • S. Monikandan • 2015 An ecard of a graph$G\$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph ...