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

41–50 of 114 results.

• Ali Reza Ashrafi • Ahmad Gholami • Zeinab Mehranian
• 2017
The power graph $\mathcal{P}(G)$ of a group $G$ is the graphwith group elements as vertex set and two elements areadjacent if one is a power of the other. The aim of this paper is to compute the autom...
• Omid Khormali
• 2017
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$. ...
• S. M. Hosseini Moghaddam • D. A. Mojdeh • Babak Samadi • Lutz Volkmann
• 2017
In this paper, we study the signed 2-independence number in graphs and give new sharp upper and lower bounds on the signed 2-independence number of a graph by a simple uniform approach. In this way, w...
• Alain Valette
• 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...
• K. Pravas • A. Vijayakumar
• 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...
• Charles Delorme
• 2016
We revisit Hoffman relation involving chromatic number $\chi$ and eigenvalues. We construct some graphs and weighted graphs such that the largest and smallest eigenvalues $\lambda$ dan $\mu$ satisfy $... • Ioan Tomescu • 2016 In this paper, we show that in the classof connected graphs$G$of order$n\geq 3$having girth at least equal to$k$,$3\leq k\leq n$, the unique graph$G$having minimum general sum-connectivity ind... • Maryam Atapour • Seyyed Mahmoud Sheikholeslami • 2016 A nonnegative signed dominating function (NNSDF) of a graph$G$is a function$f$from the vertex set$V(G)$to the set$\{-1,1\}$such that$\sum_{u\in N[v]}f(u)\ge 0$for every vertex$v\inV(G)$. The ... • Christian Barrientos • Sarah M. Minion • 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... • Bart Demoen • Phuong-Lan Nguyen • 2016 A graph edge is$d$-coloring redundant if the removal of the edge doesnot change the set of$d\$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges. Tig...
per halaman