We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

This paper provides further results on the perfect state transfer in integral circulant graphs (ICG graphs). The non-existence of PST is proved for several classes of ICG graphs containing an isolated divisor d0, i.e. the divisor which is relatively prime to all other divisors from d ∈ D \ {d0}. The same result is obtained for classes of integral circulant graphs having the NSF property (i.e. e...

Classifying integral graphs is a hard problem that initiated by Harary and Schwenk in 1974. In this paper, with the help of character table, we treat corresponding for Cayley over semi-dihedral group SD8n = ?a,b | a4n b2 1; bab a2n-1?, n ? 2. We present several necessary sufficient conditions integrality SD8n, also obtain some simple terms Boolean algebra hai. particular, give groups SD2n (n?4)...

We prove that the Cayley graphs $X(G,S)$ and $X^+(G,S)$ are equienergetic for any abelian group $G$ symmetric subset $S$. then focus on family of unitary $G_R=X(R,R^*)$, where $R$ is a finite commutative ring with identity. show under mild conditions, $\{G_R, G_R^+\}$ pairs integral non-isospectral (generically connected non-bipartite). Then, we obtain conditions such \bar G_R\}$ graphs. Finall...

Graphs are an integral data structure for many parts of computation. They are highly effective at modeling many varied and flexible domains, and are excellent for representing the way humans themselves conceive of the world. Nowadays, there is lots of interest in working with large graphs, including social network graphs, “knowledge” graphs, and large bipartite graphs (for example, the Netflix ...