Integral Cayley graphs, a notable subject within spectral graph theory, are graphs constructed from finite groups with the defining property that all eigenvalues of their associated adjacency matrices ...

Department of Mathematics and Statistics, Qinghai Minzu University, Xining, China. Since then, much attention has been paid to this topic, but they mainly focus on undirected graphs and integral trees ...

ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the ...

Abstract: The problem of the invariant description of the graph structure is solved by the vertices differentiation method and by forming on its basis integral graph descriptor (ISD). The process of ...

The main.cpp file is the actual solver. Solved for the integral sum-diameter of path graphs with a sufficient number of vertices theoretically, used above program to verify result for small n. The ...

The main.cpp file is the actual solver. Solved for the integral sum-diameter of path graphs with a sufficient number of vertices theoretically, used above program to verify result for small n. The ...