Indonesian Combinatorial Society (InaCombS)
Learned Society in 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.
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.
Fields of study: Mathematics & Statistics
Journals published by InaCombS:
Catalogue
81–100 of 114 results.
-
• 2015
English
Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red ed... -
• 2015
English
This paper gives an errata to the paper "New measure of graph irregularity", Electronic Journal of Graph Theory and Applications {\bf 2}(1) (2014), 52-65.
-
• 2015
English
We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $...
-
• 2015
English
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...
-
• 2015
English
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...
-
• 2015
English
An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=...
-
• 2014
English
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint cycle packing in a polyhedral graph G. Bounds on the cardinality of such packings are provided, that ...
-
• 2014
English
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...
-
• 2014
English
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
-
• 2014
English
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest integer $N$ such that for any graph $G$ of order $N$, either $G$ contains $F$ or the complement of $G$ contains $H$. Let $F...
-
• 2014
English
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...
-
• 2014
English
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 ...
-
• 2014
English
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)...
-
• 2014
English
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...
-
• 2014
English
A set D of vertices in a graph G = (V (G), E(G)) is an open neighborhood locating-dominating set (OLD-set) for G if for every two vertices u, v of V (G) the sets N(u) ∩ D and N(v) ∩ D are non-empty an...
-
• 2014
English
A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length at most k from u to v. If the diameter of G is k, we sa...
-
• 2014
English
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...
-
• 2014
English
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...
-
• 2014
English
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 ...
-
Algebraic and Computer-based Methods in the Undirected Degree/diameter Problem - a Brief Survey Download• 2014
English
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.