-
21
Decomposition of hypercube graphs into paths and cycles having k edges
Published 2025-01-01“…AKCE International Journal of Graphs and Combinatorics…”
Get full text
Article -
22
Sufficient conditions for the existence of path-factors with given properties
Published 2025-01-01“…AKCE International Journal of Graphs and Combinatorics…”
Get full text
Article -
23
Existence of acyclic matching and Morse complex on transitive digraphs
Published 2025-01-01“…AKCE International Journal of Graphs and Combinatorics…”
Get full text
Article -
24
Some complexity results on semipaired domination in graphs
Published 2024-12-01“…AKCE International Journal of Graphs and Combinatorics…”
Get full text
Article -
25
Power graphs and a combinatorial property of abundant semigroups
Published 2025-01-01“…AKCE International Journal of Graphs and Combinatorics…”
Get full text
Article -
26
-
27
-
28
An analytic problem in combinatorial structures
Published 2000-12-01“… An asymptotical formula for the Taylor coefficients of the generating series appearing in combinatorics is obtained. It is applied to derive a formula for the number of multisets of increasing weight. …”
Get full text
Article -
29
Central Limit Theorem for Coloured Hard Dimers
Published 2010-01-01“…The techniques used at arriving this result comprise combinatorics, generating functions, and conditional expectations.…”
Get full text
Article -
30
Series and Summations on Binomial Coefficients of Optimized Combination
Published 2022-04-01“… This paper presents innovative series and summations derived from the optimized combinations relating to the combinatorics. These series and summations will be useful for the researchers who are involving to solve the scientific problems. …”
Get full text
Article -
31
The closed neighborhood and filter conditions in solid sequence spaces
Published 1989-01-01Get full text
Article -
32
Geometric Representations of Interacting Maps
Published 2010-01-01“…On the other hand, automata appear in various contexts in topology, combinatorics, and integrable systems. In this paper we study the analysis of these materials passing through tropical geometry. …”
Get full text
Article -
33
Coassociative grammar, periodic orbits, and quantum random walk over ℤ
Published 2005-01-01“…Inspired by a work of Joni and Rota, we show that the combinatorics generated by a quantisation of the Bernoulli random walk over ℤ can be described from a coassociative coalgebra. …”
Get full text
Article -
34
Prefixes of the Fibonacci word that end with a cube
Published 2023-01-01“…The Fibonacci word $\mathbf{f} = 010010100100101\cdots $ is one of the most well-studied words in the area of combinatorics on words. It is not periodic, but nevertheless contains many highly periodic factors (contiguous subwords). …”
Get full text
Article -
35
Workflow Modelling and Analysis Based on the Construction of Task Models
Published 2015-01-01Get full text
Article -
36
A new class of generalized polynomials associated with Milne-Thomson-based poly-Bernoulli polynomials
Published 2024-01-01“…Motivated by their importance and potential for applications in certain problems in number theory, combinatorics, classical and numerical analysis, and other field of applied mathematics, a variety of polynomials and numbers with their variants and extensions have recently been introduced and investigated. …”
Get full text
Article -
37
Problems for combinatorial numbers satisfying a class of triangular arrays
Published 2023-11-01“…In this work, we derive the general analytic expression of the numbers satisfying a class of triangular arrays and propose problems (both teaching and unsolved ones) for undergraduates studying probability theory and analytical combinatorics subjects in the study programs of the fields of mathematics and computer science. …”
Get full text
Article -
38
Modification des prédicats d’achèvements par les compléments de manière
Published 2024-12-01“…Based on a sample of 4,000 sentences excerpted from Le Clézio’s novel Étoile errante, a detailed analysis of the combinatorics of verbal predicates and manner adjuncts has been carried out in order to verify whether and to what extent the four Vendlerian classes (States, Activities, Accomplishments and Achievements) are compatible with a syntagmatic specification of manner. …”
Get full text
Article -
39
APPLICATION OF LEXICOGRAPHIC METHODS IN FINDING NEW SOLUTIONS FOR THE CONSTRUCTION OF SWITCH FAUCETS
Published 2021-01-01“…For the elaboration and efficient use of logical-deductive methods and techniques in creativity, it is necessary to know a minimum of combinatorics, which include arrangements, combinations, permutations, graphs and finite networks. …”
Get full text
Article -
40
Translational and great Darboux cyclides
Published 2024-05-01“…These are some corollaries from our classification of translational and great Darboux cyclides. We use the combinatorics associated to the set of low degree curves on such surfaces modulo numerical equivalence.…”
Get full text
Article