Related papers: Generalized Riemann Functions, Their Weights, and …
For a graph $F$, we say a hypergraph is a Berge-$F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is a Berge-$F$. The…
Let $G$ be a connected graph with vertex set $V$ and a {\em weight function} $\rho$ that assigns a nonnegative number to each of its vertices. Then, the {\em $\rho$-moment} of $G$ at vertex $u$ is defined to be $M_G^{\rho}(u)=\sum_{v\in V}…
In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph $\bar G$ of an unweighted…
The research shows that Riemann proved that all of zeros of Riemann's zeta function are on $\sigma=1/2$ based on the functional equation \begin{align*} \pi^{-\frac{s}{2}}\Gamma \left( \frac{s}{2} \right) \zeta(s)&={\frac{1}{s(s-1)} +…
By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…
By the second mean-value theorem of calculus (Gauss-Bonnet theorem) we prove that the class of functions ${\mit \Xi}(z)$ with an integral representation of the form $\int_{0}^{+\infty}du\,{\mit \Omega}(u)\,{\rm ch}(uz)$ with a real-valued…
This paper is a continuation of our recent papers with the same title, arXiv:0806.1596v1 [math.NT], arXiv:0904.1277v1 where a number of integral equalities involving integrals of the logarithm of the Riemann zeta-function were introduced…
The edge-Wiener index of a connected graph $G$ is defined as the Wiener index of the line graph of $G$. In this paper it is shown that the edge-Wiener index of an edge-weighted graph can be computed in terms of the Wiener index, the…
A representation of the perturbation series of a general functional measure is given in terms of generalized Feynman graphs and -rules. The graphical calculus is applied to certain functional measures of L\'evy type. A graphical notion of…
We show that there exists an entire function f without zeros for which the associated Newton function N(z)=z-f(z)/f'(z) is a transcendental meromorphic functions without Baker domains. We also show that there exists an entire function f…
A weighted graph $G^{\omega}$ consists of a simple graph $G$ with a weight $\omega$, which is a mapping,$\omega$: $E(G)\rightarrow\mathbb{Z}\backslash\{0\}$. A signed graph is a graph whose edges are labeled with $-1$ or $1$. In this paper,…
The meromorphic function $W(s)$ introduced in the Riemann-Zeta function $\zeta(s) = W(s) \zeta(1-s)$ maps the line of $s = 1/2 + it$ onto the unit circle in $W$-space. $|W(s)| = 0$ gives the trivial zeroes of the Riemann-Zeta function…
We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…
In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…
The primary objective of this paper is to employ methods from analytic number theory to investigate the mean value properties of a composite function involving the Dirichlet divisor function and a generalized minimal power function.…
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…
Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…
In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean function, introduce a notion of strong regularity and give several of its properties. We show some connections between this concept and generalized…
A weighted (directed) graph is a (directed) graph with integer weights assigned to its vertices and edges. The weight of a subgraph is the sum of weights of vertices and edges in the subgraph. The problem of determining the largest order…