Related papers: The centipede is determined by its Laplacian spect…
In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the…
Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…
A theta curve is a spatial embedding of the $\theta$-graph in the three-sphere, taken up to ambient isotopy. We define the determinant of a theta curve as an integer-valued invariant arising from the first homology of its Klein cover. When…
Let $\Omega \subset \mathbb R^3$ be a waveguide which is obtained by translating a cross-section in a constant direction along an unbounded spatial curve. Consider $-\Delta_{\Omega}^D$ the Dirichlet Laplacian operator in $\Omega$. Under the…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
Graphs on integer points of polytopes whose edges come from a set of allowed differences are studied. It is shown that any simple graph can be embedded in that way. The minimal dimension of such a representation is the fiber dimension of…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
A quaternion unit gain graph is a graph where each orientation of an edge is given a quaternion unit, and the opposite orientation is assigned the inverse of this quaternion unit. In this paper, we provide a combinatorial description of the…
The pentagram map is a discrete dynamical system defined on the space of polygons in the plane. In the first paper on the subject, R. Schwartz proved that the pentagram map produces from each convex polygon a sequence of successively…
A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$…
The structure of the spectrum of the three-dimensional Dirichlet Laplacian in the 3D polyhedral layer of fixed width is studied. It appears that the essential spectrum is defined by the smallest dihedral angle that forms the boundary of the…
We study the set of all determinants of adjacency matrices of graphs with a given number of vertices.
Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the…
A \emph{geometric graph} is a graph whose vertex set is a set of points in general position in the plane, and its edges are straight line segments joining these points. We show that for every integer $k \ge 2$, there exists a constat $c>0$…
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
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…