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

51–100 of 114 results.

• M. H. Akhbari • Nader Jafari Rad
• 2016
A set $D$ of vertices in a graph $G=(V,E)$ is a total dominatingset if every vertex of $G$ is adjacent to some vertex in $D$. Atotal dominating set $D$ of $G$ is said to be weak if everyvertex $v\in V... • 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...
• 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...
• 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 $... • N. S. A. Karim • Roslan Hasni • Gee-Choon Lau • 2016 For a graph$G$, let$P(G,\lambda)$denote the chromatic polynomial of$G$. Two graphs$G$and$H$are chromatically equivalent if they share the same chromatic polynomial. A graph$G$is chromaticall... • Salman Fawzi Ghazal • 2016 Let$D$be a digraph without digons. Seymour's second neighborhood conjecture states that$D$has a vertex$v$such that$d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for di... • David J. Aldous • 2016 Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\em routes} rather than {\em edges} as primitives. This artic... • 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... • Ismail Sahul Hamid • S. Balamurugan • A. Navaneethakrishnan • 2016 A set$S$of vertices of a graph$G$such that$\left\langle S\right\rangle$has an isolated vertex is called an \emph{isolate set} of$G$. The minimum and maximum cardinality of a maximal isolate set... • 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}$... • 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 ... • 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... • Chandrashekar Adiga • Rakshith B. R. • K.N., Subba Krishna • 2016 In this paper we define extended corona and extended neighborhoodcorona of two graphs$G_{1}$and$G_{2}$, which are denoted by$G_{1}\bullet G_{2}$and$G_{1}\ast G_{2}$respectively. Wecompute their ... • Sung Sik U. • 2016 This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs$K_m+H_n$and$K_m+K_{n,p}$, where$H_n$is a graph with$n$isolated vertices. • Michael Haythorpe • 2016 A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing$5n-9$vertices and$k$Hamiltonian cycles for any choice of integers$n \geq k \geq 4$.... • Jeremy Moody • P. K. Aravind • 2015 This paper shows how a method developed by Van Steenwijk can be generalized to calculate the resistance between any two vertices of a symmetrical polytope all of whose edges are identical resistors. T... • Christian Rubio Montiel • 2015 A graph$G$is \emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number)$\alpha(G)$equals the number of (maxim... • Seyed Mahmoud Sheikholeslami • Lutz Volkmann • 2015 Let$D$be a finite and simple digraph with vertex set$V(D)$.A {\em signed Roman dominating function} on the digraph$D$isa function$f:V (D)\longrightarrow \{-1, 1, 2\}$such that$\sum_{u\in N^-[v...
• Rafael Del Valle Vega
• 2015
The Brualdi-Shen Conjecture on Eulerian Bipartite Tournaments states that any such graph can be decomposed into oriented 4-cycles. In this article we prove the balanced case of the mentioned conjectur...
• Gholam Hassan Shirdel • Nasrin Kahkeshani
• 2015
The purpose of the independent set interdiction problem in the weighted graph $G$ is to determine a set of vertices $R^*$ such that the weight of the maximum independent set in $G-R^*$ is minimized. W...
• Harishchandra S. Ramane • Ashwini S. Yalnaik
• 2015
The reciprocal complementary distance (RCD) matrix of a graph $G$ is defined as $RCD(G) = [rc_{ij}]$ where $rc_{ij} = \frac{1}{1+D-d_{ij}}$ if $i \neq j$ and $rc_{ij} = 0$, otherwise, where $D$ is the...
• Jemal Abawajy • Andrei Kelarev • Joe Ryan
• 2015
The present article continues the investigation of visible ideal bases in constructions defined using directed graphs. This notion is motivated by its applications for the design of classication syste...
• 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 ...
• Antoon H. Boode • Hajo Broersma • Jan F. Broenink
• 2015
In this paper we introduce and study a directed tree problem motivated by a new graph product that we have recently introduced and analysed in two conference contributions in the context of periodic r...
• 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...
• Xueliang Li • Yongtang Shi • Martin Trinks
• 2015
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a gr...
• Hilal A. Ganie • Shariefuddin Pirzada • Edy Tri Baskoro
• 2015
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy...
• Salman Ghazal
• 2015
Seymour's second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex i...
• 2015
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)... • Jonathan L. Gross • Toufik Mansour • Thomas W. Tucker • David G. L. Wang • 2015 A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria u... • Kristiana Wijaya • Edy Tri Baskoro • Hilda Assiyatun • Djoko Suprijanto • 2015 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... • Clive Elphick • Pawel Wocjan • 2015 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. • C. Dalfo • M. A. Fiol • M. Mitjana • 2015 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$...
• 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...
• Anita Abildgaard Sillasen
• 2015
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...
• S. Arockiaraj • P. Mahalakshmi • P. Namasivayam
• 2015
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))=... • Peter Recht • Stefan Stehling • 2014 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 ... • 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. • Yanbo Zhang • Yaojun Chen • 2014 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...
• 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 ...
• 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)... • 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... • Mustapha Chellali • Nader Jafari Rad • Suk Jai Seo • Peter James Slater • 2014 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... • Anita Abildgaard Sillasen • 2014 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... • 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... • 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...
• 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 ...
• Hebert Perez-Roses
• 2014
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.
per halaman