
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 021
- Pages: 147-159
- Published: 30/06/1996
In this paper we show that the complete graph
is not decomposable into three factors of diameter two, thus
resolving a longstanding open problem. This result completes
the solution of decomposition of a complete graph into three
factors, one of which has diameter two and the other factors
have finite diameters.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 129-145
- Published: 30/06/1996
The edge-integrity of a graph measures the difficulty of breaking it into pieces through the removal of a set of edges, taking into account both the number of edges removed and the size of the largest surviving component. We develop some techniques for bounding, estimating and computing the edge-integrity of products of graphs, paying particular attention to grid graphs.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 109-127
- Published: 30/06/1996
We describe an algorithm for computing the number
The method described here has been implemented. Numerical data resulting from this implementation are presented at the end of this article.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 97-108
- Published: 30/06/1996
The core
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 65-83
- Published: 30/06/1996
A
We show that for sufficiently large
If
- If
is an odd prime power, then for all , except possibly for the case where and is congruent to . - If
is not prime, then for all , where is the smallest proper factor of .
- Research article
- Full Text
Motivated by questions about semilattices of ordered compactifications, we study the structure of the lattice
We describe the covering relation of such lattices and characterize “modular” and “semimodular” elements. In particular, we show that the closed equivalence relations on
As a consequence of these results, two compact spaces are homeomorphic if and only if their lattices of closed quasiorders are isomorphic.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 33-39
- Published: 30/06/1996
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 25-31
- Published: 30/06/1996
Methods of computing fixed points can be regarded as the culmination of many years of mathematical research, starting with Brouwer’s nonconstructive fixed point theorem in 1910. The breakthrough came in 1967 when Scarf succeeded in giving the first constructive proof of Brouwer’s fixed point theorem.
There are now a number of algorithms for computing fixed points using triangulation or primitive sets, based on Scarf’s concept, and complementary pivoting techniques. All these algorithms provide a constructive proof of Sperner’s Lemma for triangulation or a version of Sperner’s Lemma for primitive sets.
It is shown that they have a common combinatorial structure, which can be described, for instance, in terms of maximal chains with respect to a binary relation. This can be the basis for constructing new algorithms of similar type.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 3-24
- Published: 30/06/1996
This paper studies a special instance of the graph partitioning problem motivated by an application in parallel processing. When a parallel computation is represented by a weighted task graph, we consider the problem of mapping each node in the graph to a processor in a linear array. We focus on a particular type of computation, a grid structured computation (GSC), where the task graph is a grid of nodes.
The general task graph mapping problem is known to be intractable, and thus past research efforts have either proposed heuristics for the general problem or optimally solved a constrained version of the general problem. Our contributions in this paper fall into both categories. We weaken past constraints and optimally solve a less constrained problem than has been solved optimally before and also present and analyze a simple greedy heuristic.
Optimal solutions have been given in the past when one places the contiguity constraint that each partition must consist of entire columns (or rows) of the GSC. We show that a more efficient solution can be found by relaxing the constraints on the partitions to allow parts of consecutive columns to be mapped to a processor; we call this weaker contiguity constraint the part-column constraint.
Our first result is to show that the problem of finding an optimal mapping satisfying the contiguity constraint remains NP-complete, where the contiguity constraint simply requires adjacent nodes to be mapped to the same or adjacent processors. We then design an
Our loosening of past constraints is shown to lead to a forty percent improvement in some cases. Other experimental results compare the proposed heuristic with the optimal algorithm.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 021
- Pages: 85-95
- Published: 30/06/1996
Let