Related papers: Lifting of cycles in functional graphs
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
Suppose $Y$ is a regular covering of a graph $X$ with covering transformation group $\pi = \mathbb{Z}$. This paper gives an explicit formula for the $L^2$ zeta function of $Y$ and computes examples. When $\pi = \mathbb{Z}$, the $L^2$ zeta…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
Some well-known results of Prodinger and Tichy are that the number of independent sets in the $n$-vertex path graph is $F_{n+2}$, and that the number of independent sets in the $n$-vertex cycle graph is $L_n$. We generalize these results by…
Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
In this Paper we defined the improved concept of fuzzy magic Graph as the set of two injective functions defined on [0; 1] such that sum of the labeled defined on vertices greater than respective edge label while sum of two vertices and…
In this paper, we give a geometric interpretation of optimal functionals in the context of intersection of symmetry planes and cyclic polytopes. For 1D CFTs, we demonstrate that at given derivative order, the functional is given by a…
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
Understanding the functional graph of a nonlinear map over a finite domain is crucial for analyzing its dynamical complexity and potential applications in cryptography and pseudorandom generation. In this paper, we investigate the graph…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…