a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

we characterize the rational subsets of a finite group and discuss the relations to integral cayley graphs.

we investigate the classical h.~zassenhaus conjecture‎ ‎for integral group rings of alternating groups $a_9$ and $a_{10}$ of degree‎ ‎$9$ and $10$‎, ‎respectively‎. ‎as a consequence of our‎ ‎previous results we confirm the prime graph‎ ‎conjecture for integral group rings of $a_n$ for all $n leq 10$‎.

‎the subject of this paper is the solution of the fredholm integral equation with toeplitz, hankel and the toeplitz plus hankel kernel. the mean value theorem for integrals is applied and then extended for solving high dimensional problems and finally, some example and graph of error function are presented to show the ability and simplicity of the ‎method.

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...