Related papers: Conjectured Bounds for 2-Local Hamiltonians via To…
In this paper, we compute minimum second neighborhood degree spectrum and energy of commuting graphs of certain finite non-commutative rings. In particular, we consider non-commutative rings of order $p^2, p^3, p^4, p^5, p^2q$ and $p^3q$,…
In the edge-2star model with hard constraints we prove the existence of an open set of constraint parameters, bisected by a line segment on which there are nonunique entropy-optimal graphons related by a symmetry. At each point in the open…
Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$, and furthermore, they proposed a conjecture that for every graph $G$, $\En(G)$ is not more than $\EnL(G)$. Unfortunately,…
For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…
In 1993 Hong asked what are the best bounds on the $k$'th largest eigenvalue $\lambda_{k}(G)$ of a graph $G$ of order $n$. This challenging question has never been tackled for any $2<k<n$. In the present paper tight bounds are obtained for…
Given any graph $G$, the (adjacency) spread of $G$ is the maximum absolute difference between any two eigenvalues of the adjacency matrix of $G$. In this paper, we resolve a pair of 20-year-old conjectures of Gregory, Hershkowitz, and…
For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…
We analytically calculate the energy spectrum of a circular graphene quantum dot with radius R subjected to a perpendicular magnetic field B by applying the infinite-mass boundary condition. We can retrieve well-known limits for the cases…
We consider a free quantum particle in one dimension whose mass profile exhibits jump discontinuities. The corresponding Hamiltonian is a self-adjoint realisation of the kinetic-energy operator, with the specific realisation determined by…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
Large spin systems as given by magnetic macromolecules or two-dimensional spin arrays rule out an exact diagonalization of the Hamiltonian. Nevertheless, it is possible to derive upper and lower bounds of the minimal energies, i.e. the…
Let $G$ be a simple graph or hypergraph, and let $A(G),L(G),Q(G)$ be the adjacency, Laplacian and signless Laplacian tensors of $G$ respectively. The largest $H$-eigenvalues (resp., the spectral radii) of $L(G),Q(G)$ are denoted…
We construct quantum models of two particles on a compact metric graph with singular two-particle interactions. The Hamiltonians are self-adjoint realisations of Laplacians acting on functions defined on pairs of edges in such a way that…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…
In 2003, Fischermann et al. considered the maximum size of \textit{uniquely-dominatable} graphs, graphs whose dominating number is realized only by a unique dominating set. They conjectured a size bound and provide a general graph…
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with linear degrees and a $d$-dimensional random geometric graph $G^d(n,r)$, for any $d\geq1$. We obtain an asymptotically optimal bound on the…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…