Related papers: Generalized Riemann Functions, Their Weights, and …
A perfect Italian dominating function of a graph $G=(V,E)$ is a function $f : V \to \{0,1,2\}$ such that for every vertex $f(v) = 0$, it holds that $\sum_{u \in N(v)} f(u) = 2$, i.e., the weight of the labels assigned by $f$ to the…
Consider all possible ways of attaching disjoint chords to two ordered and oriented disjoint intervals so as to produce a connected graph. Taking the intervals to lie in the real axis with the induced orientation and the chords to lie in…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We construct a single explicit entire function $\Xi_c(s)$ of order 1, with all zeros provably on $Re(s) = 1/2$, satisfying a functional equation $\Xi_c(s) = \Xi_c(1-s)$, whose normalized form $Z_c(s) =…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
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…
In this paper we investigate problems on almost everywhere convergence of subsequences of Riemann sums \md0 R_nf(x)=\frac{1}{n}\sum_{k=0}^{n-1}f\bigg(x+\frac{k}{n}\bigg),\quad x\in \ZT. \emd We establish a relevant connection between…
For a connected locally path-connected topological space $X$ and a continuous function $f$ on it such that its Reeb graph $R_f$ is a finite topological graph, we show that the cycle rank of $R_f$, i.e., the first Betti number $b_1(R_f)$, in…
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factorizations. For $(d,r)$-regular hypergraphs, we show that a modified…
The foundation model has heralded a new era in artificial intelligence, pretraining a single model to offer cross-domain transferability on different datasets. Graph neural networks excel at learning graph data, the omnipresent…
We present numerical techniques based on generalized functions adapted to nonlinear calculations. They concern main numerical engineering problems ruled by-or issued from-nonlinear equations of continuum mechanics. The aim of this text is…
A Roman $\{3\}$-dominating function on a graph $G = (V, E)$ is a function $f: V \rightarrow \{0, 1, 2, 3\}$ such that for each vertex $u \in V$, if $f(u) = 0$ then $\sum_{v \in N(u)} f(v) \geq 3$ and if $f(u) = 1$ then $\sum_{v \in N(u)}…
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time.…
Monotonicity properties of the ratio $$ \log \frac{f(x+a_1)\cdots f(x+a_n)}{f(x+b_1)\cdots f(x+b_n)}, $$ where $f$ is an entire function are investigated. Earlier results for Euler's gamma function and other entire functions of genus 1 are…
The main result of the paper is a definition of possible ways of the confirmation of the Riemann hypothesis based on the properties of the vector system of the second approximate equation of the Riemann Zeta function. The paper uses a…
Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
A real number is called simply normal to base $b$ if every digit $0,1,\ldots ,b-1$ should appear in its $b$-adic expansion with the same frequency $1/b$. A real number is called normal to base $b$ if it is simply normal to every base $b,…
Let $G$ be a graph with vertex set $V$ and let $g, f : V\rightarrow \mathbb{Z}^+$ be two functions such that $g\le f$. We say that $G$ has all $(g, f )$-factors if $G$ has an $h$-factor for every $h: V\rightarrow \mathbb{Z}^+$ such that…
The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and it has been applied in a myriad of different variants and…