pith. sign in

arxiv: 1506.02855 · v1 · pith:476TIVS4new · submitted 2015-06-09 · 🧮 math.SP

Spectral properties of weighted line digraphs

classification 🧮 math.SP
keywords graphlineoperatorweightedboundarydigraphsmatrixspace
0
0 comments X
read the original abstract

In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph $G$, the adjacency matrix of the weighted line digraph $W$ is determined by a boundary operator from an arc-based space to a vertex-based space. We see that depending on the boundary operator and the Hilbert spaces, $W$ has different kind of an underlying stochastic transition operator. As an application, we obtain the spectrum of the positive support of cube of the Grover matrix in a large girth of the graph.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Arc search in graphs via Szegedy walks

    quant-ph 2026-04 unverdicted novelty 6.0

    Szegedy walks for arc search in graphs give success probability independent of marked arc when the graph is arc-transitive, ineffective on paths and cycles but effective on K_{n,n}.