Related papers: Discrete trace formulas and holomorphic functional…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
It is known that the generating function associated with the enumeration of non-backtracking walks on finite graphs is a rational matrix-valued function of the parameter; such function is also closely related to graph-theoretical results…
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
The spectral theory of quantum graphs is related via an exact trace formula with the spectrum of the lengths of periodic orbits (cycles) on the graphs. The latter is a degenerate spectrum, and understanding its structure (i.e.,finding out…
For a graph G, the spectral radius \r{ho}(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we seek the relationship between \r{ho}(G) and the walks of the subgraphs of G. Especially, if G contains a complete…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
We propose a method to simultaneously compute scalar basis functions with an associated functional map for a given pair of triangle meshes. Unlike previous techniques that put emphasis on smoothness with respect to the Laplace--Beltrami…
Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
We establish endoscopic and stable trace formulas whose discrete spectral terms are weighted by automorphic $L$-functions, by the use of basic functions that are incorporated into the global spectral and geometric coefficients. This is a…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…
Graph pattern matching is a fundamental operation for the analysis and exploration ofdata graphs. In thispaper, we presenta novel approachfor efficiently finding homomorphic matches for hybrid graph patterns, where each pattern edge may be…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…
We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so,…
We combine the theory of traces in homotopical algebra with sheaf theory in derived algebraic geometry to deduce general fixed point and character formulas. The formalism of dimension (or Hochschild homology) of a dualizable object in the…