In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to class digraphs and several results for vertex colorings in digraphs. Although, as a consequence these results, digraph can be obtained by constructions (directed identifying non-adjacent vertices), determining obtain is complex problem. particular, et posed problem operations construct symmetric 5-cycle from complete orde...

in this paper, an algorithm is presented for the formation of optimal null basis vectors corresponding to sparse flexibility matrices. for controlling the independence of the vectors, a generator is selected in each corresponding self-equilibrating systems, and the sequence of generators is modeled as decision variables. since the equilibrium conditions and uniqueness of generators consists a u...

Cartesian genetic programming (CGP) represents the most efficient method for evolution of digital circuits. Despite many successful applications, however, CGP suffers from limited scalability, especially when used evolutionary circuit design, i.e. design circuits a randomly initialized population. Considering multiplier problem, example, 5\(\times\)5-bit complex designed by scratch. The efficie...

0