Let n and k be integers with n> 2k n> 2 k, k ≥ 1 k≥ 1. We denote by H (n, k) the bipartite
Kneser graph, that is, a graph with the family of k-subsets and (nk nk)-subsets of n={1, 2 …

Abstract Let n> 3 n> 3 and 0< k< n 2 0< k< n 2 be integers. In this paper, we investigate
some algebraic properties of the line graph of the graph Q_n (k, k+ 1) Q n (k, k+ 1) where …

Let $ G=(V, E) $ be a connected graph with the vertex-set $ V $ and the edge-set $ E $. The
subdivision graph $ S (G) $ of the graph $ G $ is obtained from $ G $ by adding a vertex in …

The distance eigenvalues of a connected graph G are the eigenvalues of its distance matrix
D (G). A graph is called distance integral if all of its distance eigenvalues are integers. Let …

The token graphs of graphs have been studied at least from the 80's with different names
and by different authors. The Johnson graph J (n, k) is isomorphic to the k-token graph of the …

Abstract Given $ n, m\in\mathbb {N} $ with $ m< n $ and Let $ I=\{1,..., n\} $. The Johnson
graph $ J (n, m) $ is defined as the graph whose vertex set is $ V=\{v\mid v\subseteq I,| v …

Let $ k\geq 1$ be an integer and $ n= 3k-1$. Let $\mathbb {Z} _n $ denote the additive
group of integers modulo $ n $ and let $ C $ be the subset of $\mathbb {Z} _n $ consisting of …

A design graph is a regular bipartite graph in which any two distinct vertices of the same part
have the same number of common neighbors. This class of graphs has a close relationship …

For any given $ n, m\in\mathbb {N} $ with $ m< n $, the Johnson graph $ J (n, m) $ is defined
as the graph whose vertex set is $ V=\{v\mid v\subseteq [n]=\{1,..., n\},| v|= m\} $, where two …

Given a simple graph G, a p-restricted edge cut is a subset of edges of G whose removal
disconnects G, and such that the number of vertices in each component of the resulting …