Related papers: The Dirac operator of a graph
The two-dimensional Dirac operator describes low-energy excitations in graphene. Different choices for the boundary conditions give rise to qualitative differences in the spectrum of the resulting operator. For a family of boundary…
The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…
We consider the magnetic Dirac operator on a curved strip whose boundary carries the infinite mass boundary condition. When the magnetic field is large, we provide the reader with accurate estimates of the essential and discrete spectra. In…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
For each $1\le p<\infty$ and each countable directed graph $E$ we consider the Leavitt path $\mathbb{C}$-algebra $L(E)$ and the $L^p$-operator graph algebra $\mathcal{O}^p(E)$. We show that the (purely infinite) simplicity of…
We analyze the limit of the spectrum of a geometric Dirac-type operator under a collapse with bounded diameter and bounded sectional curvature. In the case of a smooth limit space B, we show that the limit of the spectrum is given by the…
The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear recurrence relations for D(G,x) for arbitrary graphs and for…
Let $G$ be a simple graph, $A(G)$ its adjacency matrix, and $D(G)$ its diagonal degree matrix. In 2022, \citeauthor{Wang2020} (\cite{Wang2020}) defined the family of matrices $L_\alpha$ as the convex linear combination: \[ L_\alpha(G) =…
Dirac showed that in a $(k-1)$-connected graph there is a path through each $k$ vertices. The path $k$-connectivity $\pi_k(G)$ of a graph $G$, which is a generalization of Dirac's notion, was introduced by Hager in 1986. In this paper, we…
We characterize those linear operators that can be expressed as a sum over k of terms of the form f_k(D) x^k and give several examples.
We explore the connections between the linear algebra of symmetric matrices over GF(2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can…
By "geodesic" we mean any sequence of vertices $(v_1,v_2,...,v_k)$ of a graph $G$ that constitute a shortest path from $v_1$ to $v_k$. We propose a novel, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica)…
We introduce non-linear Dirac operators in $\mathbb{R}^{n}$ associated to the $p$-harmonic equation and we extend to other contexts including spin manifolds and the sphere.
The adjacency-diametrical matrix (AD matrix) of a connected graph $G$ with diameter $d$, denoted by $AD(G)$, is the matrix indexed by the vertices of $G$ in which the $(i,j)$-entry of $AD(G)$ is $1$ if $d_G(v_i,v_j)=1$, is $d$ if…
I derive the overlap Dirac operator starting from the overlap formalism, discuss the numerical hurdles in dealing with this operator and present ways to overcome them.
Given a directed graph, there exists a universal operator algebra and universal C*-algebra associated to the directed graph. In this paper we give intrinsic constructions of these objects. We provide an explicit construction for the maximal…
The article considers some concrete solutions to the Dirac equation coupled to a vector bundle with connection, arising in the study of Yang-Mills equations and vector bundles on Riemann surfaces.
This article is one of a series of papers. For this decade, the Dirac operator on a submanifold has been studied as a restriction of the Dirac operator in $n$-dimensional euclidean space $\EE^n$ to a surface or a space curve as physical…
Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.