Research Communication | Open Access
Volume 2021 | Communication ID 283
Volume 2021 | Communication ID 283
| Characterization of k-spectrally monomorphic graphs |
Imane Souktani, Abderrahim Boussairi, Abdelhak Chaichaa
Received |
Accepted |
Published |
February 03, 2021 |
February 15, 2021 |
March 15, 2021 |
Abstract: Let G = (V,A) be a simple graph on n vertices. The Seidel adjacency matrix of the graph G is the n×n matrix S = (s_ij) in which s_ij=0 if i=j and otherwise is 1 if {v_i,v_j} is an edge, -1 if it is not. We say that G is k- monomorphic if all its subgraphs of order k are isomorphic. Moreover, we say that G is k-spectrally monomorphic if all its subgraphs with k vertices have the same characteristic polynomials. A k-monomorphic graph G is k-spectrally monomorphic. In this work, we characterize the class of k-spectrally monomorphic simple graphs of order n, whenever 2≤k≤n-2.