Related papers: Zeta-equivalent digraphs: Simultaneous cospectrali…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
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…
We confirm the equitable $\Delta$-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or…
We define a zeta function of a finite graph derived from time evolution matrix of quantum walk, and give its determinant expression. Furthermore, we generalize the above result to a periodic graph.
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…
A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the…
In this paper, we introduce a generalization of corona of graphs. This construction generalizes the generalized corona of graphs (consequently, the corona of graphs), the cluster of graphs, the corona-vertex subdivision graph of graphs and…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
We define Dirichlet type series associated with homology length spectra of Riemannian, or Finsler, manifolds, or polyhedra, and investigate some of their analytical properties. As a consequence we obtain an inequality analogous to Gromov's…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
For a digraph D and three parameters x, y, z in {0,1,+,-} we define the digraph D^(x,y,z) and call it the (x,y,z)-transformation of D. We show that for every r-regular digraph D the adjacency characteristic polynomial A(t, D^(x,y,z)) of…
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta…
We compute the equivariant zeta function for bundles over infinite graphs and for infinite covers. In particular, we give a ``transfer formula'' for the zeta function of infinite graph covers. Also, when the infinite cover is given as a…
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show that several NP-hard zero forcing numbers are not…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We give some conditions under which (uniform) convergence of a family of Dirichlet series to another Dirichlet series implies the convergence of their individual coefficients and/or exponents. We give some applications to some spectral zeta…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
From the viewpoint of quantum walks, the Ihara zeta function of a finite graph can be said to be closely related to its evolution matrix. In this note we introduce another kind of zeta function of a graph, which is closely related to, as to…
We study the spectral functions, and in particular the zeta function, associated to a class of sequences of complex numbers, called of spectral type. We investigate the decomposability of the zeta function associated to a double sequence…