Related papers: Generalized 3x + 1 Mappings : searching for cycles
Multiplex networks offer an important tool for the study of complex systems and extending techniques originally designed for single--layer networks is an important area of study. One of the most important methods for analyzing networks is…
Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower…
Family of equations, which is the generalization of the $K(m,m)$ equation, is considered. Periodic wave solutions for the family of nonlinear equations are constructed.
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
Cyclic polytopes have been studied since at least the early last century by Caratheodory and others.A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is…
A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…
We give some basic properties of strongly topologically transitive, supermixing, and hypermixing maps on general topological spaces. Then we present some other results for which our mappings need to be continuous.
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
This paper presents new methods for analyzing and evaluating generalized plans that can solve broad classes of related planning problems. Although synthesis and learning of generalized plans has been a longstanding goal in AI, it remains…
In this paper, we consider a number of results and seven conjectures on properly edge-coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of…
After a brief discussion of the history of the problem, we propose a generalization of the map colouring problem to higher dimensions.
In this paper, we convert Collatz map into a simple conjugate iterative maps defined in [0,1]. Such maps are more familiar to us and easier to deal with. Some new features of this map are observed by this method. An interesting heuristic…
Answers are offered to the Gould's question to find spectral sufficient conditions for a graph to have a chorded cycle via signless Laplacian spectral radius. The conditions are tight.
Demixing is the problem of identifying multiple structured signals from a superimposed observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. We present a new solution to determine…
We study the reflectional symmetry of a surface in the Euclidean 3-dimensional space with a cross-cap singularity with respect to planes. This symmetry is picked up by the singularities of folding maps on the cross-cap. We give a list of…
Search in cyclic AND/OR graphs was traditionally known to be an unsolved problem. In the recent past several important studies have been reported in this domain. In this paper, we have taken a fresh look at the problem. First, a new and…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.
A chorded cycle is a cycle with at least one chord. Gould asked in [Graphs Comb. 38 (2022) 189] the question: What spectral conditions imply a graph contains a chorded cycle? For a graph with fixed size, extremal spectral conditions are…
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…