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

11–20 of 114 results.

• Sudip Bera
• 2018
Given a group G, the intersection power graph of G, denoted by $\mathcal{G}_I(G)$, is the graph with vertex set G and two distinct vertices x and y are adjacent in $\mathcal{G}_I(G)$ if there exists ...
• B. Sooryanarayana • Suma A. S.
• 2018
Let G=(V,E) be a simple connected graph. A subset S of V is called a neighbourhood set of G if $G=\bigcup_{s\in S}<N[s]>$, where N[v] denotes the closed neighbourhood of the vertex v in G. Furth...
• Suresh Elumalai • Toufik Mansour • Mohammad Ali Rostami
• 2018
The hyper-Zagreb index of a simple connected graph G is defined by ${\chi ^2}(G) = \sum_{uv \in E(G)} {{{\left( {d(u) + d(v)} \right)}^2}}$. In this paper, we establish, analyze and compare some new u...
• Martin Baca • Andrea Semanicova-Fenovcikova • S. Slamin • Kiki A. Sugeng
• 2018
For a simple graph G, a vertex labeling f:V(G)\to {1, 2, ..., k} is called a k-labeling. The weight of a vertex v, denoted by $wt_f(v)$ is the sum of all vertex labels of vertices in the closed neigh...
• Eunice Mphako-Banda • Julian A. Allagan
• 2018
We give some reduction formulas for computing the Tutte polynomial of any graph with parallel classes. Several examples are given to illustrate our results.
• Anie Lusiani • Edy Tri Baskoro • Suhadi Wido Saputro
• 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...
• Vladimir R. Rosenfeld
• 2017
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...
• Phan-Thuan Do • Ngoc-Khang Le • Van-Thieu Vu
• 2017
Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many NP-hard problems can be solved in polynomial time if they are restricted on trapezoid graphs. A matching in a ...
• Denny Riama Silaban • Edy Tri Baskoro • Saladin Uttunggadewa
• 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...
• Steven Schluchter • J. Z. Schroeder
• 2017
A proper embedding of a graph G in a pseudosurface P is an embedding in which the regions of the complement of G in P are homeomorphic to discs and a vertex of G appears at each pinchpoint in P; we s...
per halaman