论文信息 - A note on the graph’s resolvent and the multifilar structure☆

A note on the graph’s resolvent and the multifilar structure☆

Abstract We consider the recently discovered [V. Ejov, J.A. Filar, S.K. Lucas, P. Zograf, Clustering of spectra and fractals of regular graphs, J. Math. Anal. Appl. 333 (2007) 236–246] threadlike structure of the plot representing d -regular graphs in the mean-variance coordinates of exponential sums of the graph spectra. In this note we demonstrate that this self-similar phenomenon is more ubiquitous by exhibiting it with the help of a different generating function, namely the mean and the variance of the resolvent of the adjacency matrix of the graph. We also discuss the location of non-Hamiltonian graphs within this geometric structure.

[1] J. A. Rodríguez-Velázquez,et al. Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2] Discrete Path Integral Approach to the Selberg Trace Formula for Regular Graphs , 2006, math-ph/0609028.

[3] I. Gutman,et al. Estrada index of cycles and paths , 2007 .

[4] Ernesto Estrada,et al. Statistical-mechanical approach to subgraph centrality in complex networks , 2007, 0905.4098.

[5] W. Haemers,et al. Which graphs are determined by their spectrum , 2003 .

[6] Frank Harary,et al. Graph Theory , 2016 .

[7] Ernesto Estrada,et al. Spectral scaling and good expansion properties in complex networks , 2006, Europhysics Letters (EPL).

[8] J. A. Peña,et al. Estimating the Estrada index , 2007 .

[9] Connected co-spectral graphs are not necessarily both Hamiltonian , 2005 .

[10] A. Sainte-Laguë. Les réseaux (ou graphes) , 1926 .

[11] S. K. Lucas,et al. Clustering of spectra and fractals of regular graphs , 2006 .