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

91–100 of 114 results.

• Yanbo Zhang • Hajo Broersma • Yaojun Chen
• 2014
Given two graphs G1 and G2, the Ramsey number R(G1;G2)is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. Let Cn ...
• Joe Demaio • John Jacobson
• 2014
In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci...
• Dominique Buset • Mirka Miller • Oudone Phanalasy • Joe Ryan
• 2014
An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, |E|\}$ such that all vertex weights are pairwise distinct, where the weight of ...
• Ayesha Shabbir
• 2014
In this note, we consider triangular, square and hexagonal lattices on the flat Klein bottle, and find subgraphs with the property that for any $j$ vertices there exists a longest path (cycle) avoidin...
• Ashish K. Upadhyay • Dipendu Maity
• 2014
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
• Henning Fernau • Juan A. Rodriguez-Velazquez
• 2014
In this paper, we show that several graph parameters are known in different areas under completely different names.More specifically, our observations connect signed domination, monopolies, $\alpha$-d...
• Cristina Dalfo • Miquel Àngel Fiol
• 2014
We study the (Delta,D) and (Delta,N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse di...
• N. Paramaguru • R. Sampathkumar
• 2014
For k≥2, a modular k-coloring of a graph G without isolated vertices is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G, the sums ...
• Deepa Sinha • Ayushi Dhama
• 2014
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{-, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigr...
• S. P. Subbiah • J. Pandimadevi
• 2014
An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q} such that for every copy H in the decomposition, \$\sum\limits_{v\in V(H)} f(v)+\sum\limits_{e\in E(H)...
per halaman