
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN: 0835-3026 (print) 2817-576X (online)
The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) embarked on its publishing journey in April 1987. From 2024 onward, it publishes four volumes per year in March, June, September and December. JCMCC has gained recognition and visibility in the academic community and is indexed in renowned databases such as MathSciNet, Zentralblatt, Engineering Village and Scopus. The scope of the journal includes; Combinatorial Mathematics, Combinatorial Computing, Artificial Intelligence and applications of Artificial Intelligence in various files.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 193-213
- Published: 30/06/1995
Let
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 186-192
- Published: 30/06/1995
A graph
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 177-185
- Published: 30/06/1995
Let
The purpose of this paper is to prove the following three theorems: (i) If
(2) If
where
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 171-175
- Published: 30/06/1995
All Williamson matrices in this Note are symmetric circulants. Eight non-equivalent sets of Williamson matrices of order
Only three non-equivalent sets of Williamson matrices of order
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 167-169
- Published: 30/06/1995
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 161-166
- Published: 30/06/1995
In this paper, we derive and present some necessary conditions for the existence of certain combinatorial arrays (called balanced arrays (
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 151-160
- Published: 30/06/1995
An explicit recurrence is obtained for the clique polynomial of a short ladder in which the two diagonals are drawn in each cell. From this result, an explicit formula for the number of decompositions of the ladder into triangles and
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 145-150
- Published: 30/06/1995
Let
We completely characterize graphs with constant neighbourhoods isomorphic to complements of regular disconnected graphs.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 129-144
- Published: 30/06/1995
A
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 018
- Pages: 125-127
- Published: 30/06/1995
Let