Spectral Characterizations of Graph Cores in Distance-Regular Graphs via Homomorphism Matrices
Spectral Characterizations of Graph Cores in Distance-Regular Graphs via Homomorphism Matrices
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
:
ABKH-ACACGF
Publication :
4th International Conference on Applied Researches in Humanities, Economics, Management & Accounting(icrhema.com)
Abstract :
This study develops a spectral and combinatorial framework for characterizing core-completeness in distance-regular graphs, a property whereby a graph is either a core itself or admits a complete graph as its core. Building upon the homomorphism-matrix methodology introduced by Roberson in the context of the Cameron–Kazanidis conjecture for strongly regular graphs, we investigate the extent to which this approach can be generalized to distance-regular graphs of arbitrary diameter (d). The proposed framework incorporates the intersection structure, eigenvalue distribution, and associated cosine sequences of distance-regular graphs to derive restrictions on their endomorphisms and retractions. In particular, we obtain necessary spectral conditions governing the existence of graph endomorphisms whose images have diameter strictly less than (d). These conditions lead to a rigidity result for primitive distance-regular graphs: whenever the subgraph induced by the vertices at maximal distance from a specified vertex is connected, every retraction onto a subgraph of diameter (d) is necessarily an automorphism. This theorem generalizes the corresponding rigidity phenomenon for strongly regular graphs, which arises as the diameter-two case. The theoretical results are complemented by computational examinations of distance-regular graphs of diameter three. Within the investigated class, no antipodal, non-bipartite distance-regular graph of valency at most (50) admits an endomorphism onto a subgraph of diameter two. Moreover, we identify numerous intersection arrays corresponding to primitive distance-regular graphs of diameter three that satisfy the core-completeness criterion. By integrating computational evidence with established techniques from algebraic graph theory, including association schemes, spectral idempotents, and intersection-array analysis, this investigation establishes a systematic approach to understanding the interplay between spectral constraints, graph homomorphisms, and core structure in distance-regular graphs.
Keywords : distance regular graph theory graph core structure spectral graph invariants graph homomorphism matrices endomorphism rigidity cosine sequence constraints association schemes spectral projection operators intersection array analysis graph retractions algebraic combinatorics