Related papers: Exterior-Interior Duality for Discrete Graphs
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
In this paper, we present some novel and intriguing findings on the geometric structures of Laplacian eigenfunctions and their deep relationship to the quantitative behaviours of the eigenfunctions in two dimensions. We introduce a new…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…
This paper concerns the asymptotic expansion of the solution of the Dirichlet-Laplace problem in a domain with small inclusions. This problem is well understood for the Neumann condition in dimension greater than two or Dirichlet condition…
Upper bounds for the eigenvalues of the Laplace-Beltrami operator on a hypersurface bounding a domain in some ambient Riemannian manifold are given in terms of the isoperimetric ratio of the domain. These results are applied to the…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We solve the problem on flat extensions of a generic surface with boundary in Euclidean 3-space, relating it to the singularity theory of the envelope generated by the boundary. We give related results on Legendre surfaces with boundaries…
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
We analyze the scattering sector of the Hamiltonians for both gapless and gapped graphene in the presence of a charge impurity using the 2D Dirac equation, which is applicable in the long wavelength limit. We show that for certain range of…
We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. Using random walks and exit times, we associate to certain subgraphs (domains) a pair of sequences, each of which…
Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e.,…
Isospectral domains are non-isometric regions of space for which the spectra of the Laplace-Beltrami operator coincide. In the two-dimensional Euclidean space, instances of such domains have been given. It has been proved for these examples…
The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…
The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…