Solitaire clobber as an optimization problem on words.
Solution of a combinatorially formulated monodromy problem of Eisenbud and Harris
Solution of distributive-like quasigroup functional equations
We are investigating quasigroup functional equation classification up to parastrophic equivalence [Sokhatsky F.M.: On classification of functional equations on quasigroups, Ukrainian Math. J. 56 (2004), no. 4, 1259–1266 (in Ukrainian)]. If functional equations are parastrophically equivalent, then their functional variables can be renamed in such a way that the obtained equations are equivalent, i.e., their solution sets are equal. There exist five classes of generalized distributive-like quasigroup...
Solution of Heawood's empire problem in the plane.
Solution of Moufang problems.
Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals.
Solution to the problem of Kubesa
An infinite family of T-factorizations of complete graphs , where 2n = 56k and k is a positive integer, in which the set of vertices of T can be split into two subsets of the same cardinality such that degree sums of vertices in both subsets are not equal, is presented. The existence of such T-factorizations provides a negative answer to the problem posed by Kubesa.
Solutions and kernels of a directed graph
Solutions de tournois : un spicilège
L'article passe en revue quelques Solutions de Tournois (correspondances de choix définies sur les tournois). On compare ces solutions entre elles, et on mentionne certaines de leurs propriétés.
Solutions of Some L(2, 1)-Coloring Related Open Problems
An L(2, 1)-coloring (or labeling) of a graph G is a vertex coloring f : V (G) → Z+ ∪ {0} such that |f(u) − f(v)| ≥ 2 for all edges uv of G, and |f(u)−f(v)| ≥ 1 if d(u, v) = 2, where d(u, v) is the distance between vertices u and v in G. The span of an L(2, 1)-coloring is the maximum color (or label) assigned by it. The span of a graph G is the smallest integer λ such that there exists an L(2, 1)-coloring of G with span λ. An L(2, 1)-coloring of a graph with span equal to the span of the graph is...
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better than the...
Solving some problems of advanced analytical nature posed in the SIAM Review. II.
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic
In this paper we present a new approach to solve the Minimum Independent Dominating Set problem in general graphs which is one of the hardest optimization problem. We propose a method using a clique partition of the graph, partition that can be obtained greedily. We provide conditions under which our method has a better complexity than the complexity of the previously known algorithms. Based on our theoretical method, we design in the second part of this paper an efficient algorithm by including...
Some (2, n) combinatorial Stein groupoids.
Some (2, n) combinatorial Stein groupoids. (Short Communication).
Some additions to the theory of star partitions of graphs
This paper contains a number of results in the theory of star partitions of graphs. We illustrate a variety of situations which can arise when the Reconstruction Theorem for graphs is used, considering in particular galaxy graphs - these are graphs in which every star set is independent. We discuss a recursive ordering of graphs based on the Reconstruction Theorem, and point out the significance of galaxy graphs in this connection.
Some additive applications of the isoperimetric approach
Let be a group and let be a finite subset. The isoperimetric method investigates the objective function , defined on the subsets with and , where is the product of by .In this paper we present all the basic facts about the isoperimetric method. We improve some of our previous results and obtain generalizations and short proofs for several known results. We also give some new applications.Some of the results obtained here will be used in coming papers to improve Kempermann structure...
Some algebraic aspects of Morse code sequences.
Some algebraic aspects of tournament theory
Some algebraic properties of hypergraphs
We consider Stanley-Reisner rings where is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that are lines and cycles, and for these we compute the Betti numbers. We also generalize some known results about chordal graphs and study a weak form of shellability.