Sökresultat - "clique"

None

Abstract: This study aims to determine the meaning of forming the self-identity of students who are members of a clique at school. This study uses a qualitative method with a phenomenological approach. The subjects in this study were three students with the initials IPA, RS, and YF. The three subjec...

Full beskrivning

MSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition. We prove an upper bound of 6 for the directed clique-width of MSP DAGs and show how a directed clique-width 6-expression can be found in line...

Full beskrivning

In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.

None

In the 1980s V.A. Bondarenko found that the clique number of the graph of a polytope in many cases corresponds to the actual complexity of the optimization problem on the vertices of the polytope. For an explanation of this phenomenon he proposed the theory of direct type algorithms. This theory ass...

Full beskrivning

We provide an effective description of graphs of polyhedra for GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH problems. We establish the fact, that the clique number for each of this problems increases exponentially with the dimension of the space.

We study the polyhedral properties of three problems of constructing an optimal biclique in a bipartite graph. In the first problem we consider a balanced biclique with the same number of vertices in both parts and arbitrary edge weights. In the other two problems it is required to find maximum or min...

Full beskrivning

In this paper, we study polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less than or equal to a given value. In the second proble...

Full beskrivning

In this paper, we consider the notion of a direct type algorithm introduced by V. A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. the concept of a direct type algorithm is determined using the graph of solutions of a combinatorial optimization p...

Full beskrivning

For n≥4n\ge 4, let OPDn{{\mathcal{OPD}}}_{n} be the orientation-preserving and order-decreasing transformation semigroup on the finite chain Xn={1<…<n}{X}_{n}=\left\{1\lt \ldots \lt \hspace{0.30em}n\right\}. First, we determine the set of two-sided zero-divisors of OPDn{{\mathcal{OPD}}}_{n}, a...

Full beskrivning

The paper explores the view of political transitions from the standpoint of capacity for collective action, and seeks to use a causal analysis of the motivation for collective action and its public articulation as a method of interpreting modern political systems that would be a feasible alternative...

Full beskrivning

The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem. This paper solves the problem of forming the maximum number of teams whose experts meet...

Full beskrivning

Let R be a finite commutative ring with identity 1. We introduce a new graph called regular divisor graph and denoted by . We classify the finite commutative ring to get a special graph and we are going to study some properties of this graph, clique number, chromatic number, number of cycles, conne...

Full beskrivning

In this paper, we introduce Indigenous semirings and show that they are examples of information algebras. We also attribute a graph to them and discuss their diameters, girths, and clique numbers. On the other hand, we prove that the Zariski topology of any Indigenous semiring is the Sierpiński spac...

Full beskrivning

The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, ver...

Full beskrivning

The paper describes software components to support recursive-parallel programming for the .NET Framework. They are dynamic link libraries providing the necessary functionality for developing and debugging applications for parallel execution on a local network. Communication module library classes pr...

Full beskrivning

Let \({E}_{n}\) be the ring of Eisenstein integers modulo \(n\). We denote by \(G({E}_{n})\) and \(G_{{E}_{n}}\), the unit graph and the unitary Cayley graph of \({E}_{n}\), respectively. In this paper, we obtain the value of the diameter, the girth, the clique number and the chromatic number of the...

Full beskrivning

Let  be a commutative ring with identity, and  be a left -module. The g-small intersection graph of non-trivial submodules of , indicated by , is a simple undirected graph whose vertices are in one-to-one correspondence with all non-trivial submodules of  and two distinct vertices are adjacent if a...

Full beskrivning

A developed model has been put for the hypothesis of capturing moons in explaining the origin of Jupiter moons, and study the change of the orbital properties of these satellites as well as the distance from the planet. Jupiter moons were divided into two types according to their physical and orbita...

Full beskrivning