Spectral Rigidity and Endomorphism Structure in Distance-Regular Graphs: A Homomorphism-Matrix Approach
Spectral Rigidity and Endomorphism Structure in Distance-Regular Graphs: A Homomorphism-Matrix Approach
Mohammadesmail Nikfar1
1) Ph.D. Graduate in Mathematics, Doctor of Philosophy (Ph.D.) in Pure Mathematics, Mathematics Teacher, District 4 Department of Education, Tehran, Iran
IOI Code
:
ABFK-ACAFKK
Publication :
The third international conference on new researches in management, law, humanities and entrepreneurship(icmlhe.ir)
Abstract :
The structural theory of graph cores provides a fundamental connection between graph homomorphisms, endomorphism monoids, and the preservation of combinatorial complexity. This paper investigates the core structure of distance-regular graphs through a unified algebraic and spectral approach, with particular emphasis on the restrictions imposed by their intersection parameters and eigenvalue configurations. Motivated by the homomorphism-matrix techniques developed by Roberson in his investigation of the Cameron–Kazanidis conjecture for strongly regular graphs, we formulate a broader framework applicable to distance-regular graphs with arbitrary diameter (d). Our methodology combines the algebraic properties of distance-regularity with spectral information encoded by eigenmatrices, primitive idempotents, and cosine sequences. These ingredients are employed to examine the feasibility of non-surjective endomorphisms, the existence of proper retracts, and the structural conditions under which a graph admits a complete graph as its core. A central component of the investigation concerns endomorphisms whose images exhibit a reduction in diameter relative to the original graph. We establish necessary spectral restrictions for such mappings and derive a rigidity theorem for primitive distance-regular graphs. Specifically, when the subgraph induced by the vertices at maximal distance from a fixed vertex is connected, every retraction onto a subgraph having diameter (d) must be an automorphism. This result extends the corresponding rigidity principle for strongly regular graphs, recovered as the special case (d=2). The theoretical framework is further examined through computational investigations of distance-regular graphs of diameter three. For the class investigated, no antipodal, non-bipartite distance-regular graph with valency not exceeding (50) admits an endomorphism onto a subgraph of diameter two. In addition, numerous intersection arrays associated with primitive distance-regular graphs of diameter three are identified as satisfying the core-completeness criterion. These computational observations provide supporting evidence for the structural restrictions developed in the theoretical analysis. By integrating homomorphism-matrix techniques with the spectral theory of association schemes and the combinatorial information contained in intersection arrays, this work advances a systematic perspective on endomorphism rigidity and core determination in distance-regular graphs. It also highlights the role of spectral compatibility in distinguishing graphs with nontrivial retracts from those whose endomorphism structure is necessarily rigid.
Keywords : distance regular structures graph endomorphism theory spectral rigidity graph cores and retracts homomorphism matrices association schemes eigenvalue multiplicities cosine sequences primitive idempotents intersection number configurations diameter preserving mappings algebraic graph theory