Related papers: Golden ratio in graph theory: A survey
This experimental study presents some interesting conjectured relations between some integer sequences and certain graph parameters of the family of linear Jaco graphs $J_n(x)$ where $n = 1,2,3,\dots$. It appears that $\textit{Golden…
The Fibonacci sequence is a series of positive integers in which, starting from $0$ and $1$, every number is the sum of two previous numbers, and the limiting ratio of any two consecutive numbers of this sequence is called the golden ratio.…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
We propose two new spectral measures for graphs and networks which characterize the ratios between the width of the "bulk" part of the spectrum and the spectral gap, as well as the ratio between spectral length and the width of the "bulk"…
Sidorov and Vershik showed that in base $G=\frac{\sqrt{5}+1}{2}$ and with the digits $0,1$ the numbers $x=nG ~(\text {mod} 1)$ have $\aleph_{0}$ expansions for any $n\in\mathbb{Z}$, while the other elements of $(0, \frac{1}{G-1})$ have…
\begin{abstract} $\pi$, the ratio between a circumference and is radius, is an irrational transcendental number. Fractal analysis is used here to show that $\pi$\textquoteright{s} digit sequence corresponds to a uniformly distributed random…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the…
While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tree number of a graph.
Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…
We have provided a pure model-theoretic proof for the decidability of the additive structure of the integers together with the function {f} sending {x} to {[\phi x]} where {\phi} is the golden ratio.
This study delves into first-passage percolation on random geometric graphs in the supercritical regime, where the graphs exhibit a unique infinite connected component. We investigate properties such as geodesic paths, moderate deviations,…
In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic random graphs} (HRGs). These models have been observed to…
Mignosi, Restivo, and Salemi (1998) proved that for all $\epsilon > 0$ there exists an integer $N$ such that all prefixes of the Fibonacci word of length $\geq N$ contain a suffix of exponent $\alpha^2-\epsilon$, where $\alpha =…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…
Although many series exist for $\pi$ and $\pi^2$, very few are known for $\pi^3$. In this article, we derive, using a trigonometric identity obtained by Euler, two representations of $\pi^3$ involving infinite sums and the golden ratio. The…
Let $\Pi$ be a hereditary graph class. The problem of deletion to $\Pi$, takes as input a graph $G$ and asks for a minimum number (or a fixed integer $k$) of vertices to be deleted from $G$ so that the resulting graph belongs to $\Pi$. This…
A $\mathbb{T}$-gain graph, $\Phi = (G, \varphi)$, is a graph in which the function $\varphi$ assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency…
In the last decade it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks: separable elements, with connections (or interactions) between certain pairs of them.…