Related papers: Planarity, duality and Laplacian congruence
We study a general class of recurrence relations that appear in the application of a matrix diagonalization procedure. We find general closed formula and determine analytical properties of the solutions. We finally apply these findings in…
In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.
The congruence orbit of a matrix has a natural connection with the linear complementarity problem on simplicial cones formulated for the matrix. In terms of the two approaches -- the congruence orbit and the family of all simplicial cones…
We provide an introductory review of some topics in spectral theory of Laplacians on metric graphs. We focus on three different aspects: the trace formula, the self-adjointness problem and connections between Laplacians on metric graphs and…
In this work, we define the Laplacian and Normalized Laplacian energies of vertices in a graph, we derive some of its properties and relate them to combinatorial, spectral and geometric quantities of the graph.
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
The spectrum of the normalized Laplacian matrix cannot determine the number of edges in a graph, however finding constructions of cospectral graphs with differing number of edges has been elusive. In this paper we use basic properties of…
A review is given of ideas in electromagnetic duality and connections to integrable field theories with soliton solutions. This leads on to a summary of recent work on Lorentzian algebras.
In this paper, we define the non-commuting graph associated to a Lie algebra L and obtain some basic graph properties such as connectivity, diameter, girth, Hamiltonian and Eulerian. Moreover, planarity, outer planarity and isomorphism…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
There is a natural duality between line congruences in $\mathbb{R}^3$ and surfaces in $\mathbb{R}^4$ that sends principal lines into asymptotic lines. The same correspondence takes the discriminant curve of a line congruence into the…
We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
We describe the duality between different geometries which arises by considering the classical and quantum harmonic map problem. To appear in ``Essays on Mirror Manifolds II''.
This is a survey article for the forthcoming `A Concise Encyclopedia of Knot Theory.' We focus on the topology of spatial graphs with few vertices and edges, paying particular attention to Brunnian $\theta$-graphs.
In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.