The nonbacktracking matrix and its eigenvalues have many applications in network science
and graph mining, such as node and edge centrality, community detection, length spectrum …

Graph distance and graph embedding are two fundamental tasks in graph mining. For graph
distance, determining the structural dissimilarity between networks is an ill-defined problem …

On the Ihara zeta function and resistance distance-based indices - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of
certain classes of graphs, with special emphasis on the leading eigenvalue or the second …

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 …

For a graph G with adjacency matrix A (G) and degree-diagonal matrix D (G), Cvetković et al
introduced a bivariate polynomial ϕ G (x, t)= det (x I−(A (G)− t D (G))), where I is the identity …

Whether comparing networks to each other or to random expectation, measuring
dissimilarity is essential to understanding the complex phenomena under study. However …

In this paper, a formula for the Ihara zeta function of the cone over a semiregular bipartite
graph is derived. Using this formula, we show that two cones over semiregular bipartite …

We derive a factorization formula for the Ihara zeta function of the corona of two graphs.
When the two graphs are regular, this factorization formula involves the graphs' adjacency …

Zeta functions of several corona-type graphs - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …