Structure and Spectral Analysis of Prime Factor Graphs: From Basic Graph Parameters to the Number-Theoretic Structure of Eigenvectors
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
This paper systematically investigates the prime factor graph G_N, a graph defined by the arithmetic condition \gcd(i,j)>1 on the vertex set \{2,3,\dots,N\}. We establish exact formulas for its degree distribution, connectivity, diameter upper bound, and prove that its maximum clique is formed by all even integers with order \lfloor N/2\rfloor. In spectral analysis, we prove that the spectral gap \lambda_2^{(N)} of the normalized Laplacian satisfies \lambda_2^{(N)} = \Theta(1/\log N), precisely characterizing the decay rate of non-expansion for this graph family. Moreover, we construct an explicit function f(i)=\log i-\Omega(i) (where \Omega(i) counts prime factors with multiplicity) and show that the second eigenvector v_2 is asymptotically collinear with f, i.e., \langle f,v_2\rangle/(\|f\|\|v_2\|)\to1. Numerical experiments with N up to 5\times10^5 confirm the theoretical results and provide quantitative comparisons with random graphs. This work introduces a new object in arithmetic graph theory and opens avenues at the intersection of spectral graph theory and analytic number theory.
Fields of Study & Subjects
Graph theory and applications
Limits and Structures in Graph Theory
Analytic Number Theory Research
Publication details
- Publication date
- 1 January 2026
- Language
- EN
- Document type
- Preprint