A weighted graph zeta function involved in the Szegedy walk

10/11/2021
by   Ayaka Ishikawa, et al.
0

We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2022

On the characteristic polynomial of the A_α-matrix for some operations of graphs

Let G be a graph of order n with adjacency matrix A(G) and diagonal matr...
research
02/13/2018

Graph-Based Ascent Algorithms for Function Maximization

We study the problem of finding the maximum of a function defined on the...
research
04/30/2019

Computing the hull number in toll convexity

A walk W between vertices u and v of a graph G is called a tolled walk ...
research
02/12/2015

Spectral Sparsification of Random-Walk Matrix Polynomials

We consider a fundamental algorithmic question in spectral graph theory:...
research
06/30/2019

Connecting edge-colouring

This paper studies the problem of connecting edge-colouring. Given an un...
research
02/12/2021

A Subexponential Algorithm for ARRIVAL

The ARRIVAL problem is to decide the fate of a train moving along the ed...
research
09/27/2020

A Weighted Quiver Kernel using Functor Homology

In this paper, we propose a new homological method to study weighted dir...

Please sign up or login with your details

Forgot password? Click here to reset