Fourth Edition of the International Conference on Research in Applied Mathematics and Computer Science ICRAMCS 2022
 March 24-25-26, 2022
Online and Face-to-Face Conference

ICRAMCS, 4 (2022) | Proceedings ISSN: 2605-7700

Research Communication | Open Access
Volume 2022 | Communication ID 501
On the spectral and skew-spectral monomorphy of graphs
Imane Souktani
Academic Editor: Youssef EL FOUTAYENI
Received
Accepted
Published
February 04, 2022
March 03, 2412
April 15, 2412

Abstract: Let G be a simple graph with vertex set V. With respect to an ordering v_1,v_2,…….v_n of V, the adjacency matrix of G is the n×n symmetric matrix A=〖[a_ij]〗_(1≤i,j≤n) in which a_ij=1 if {v_i,v_j} is an edge And a_ij=0 otherwise. The Seidel adjacency matrix of G is the n×n symmetric matrix S=〖[s_ij]〗_(1≤i,j≤n) in which s_ij=-1 if {v_i,v_j} is an edge , -1 if it is not. The characteristic polynomial of G is defined as the characteristic polynomial of its adjacency matrix and the skew characteristic polynomial of G is defined as the characteristic polynomial of ...