Let G be a graph and T be a certain connected subgraph of G. The T-structure connectivity κ
(G; T)(resp. T-substructure connectivity κ s (G; T)) of G is the minimum number of a set of …

Let G be a connected graph and ga non-negative integer, the g-extra connectivity of G is the
minimum cardinality of a set of vertices in G, if it exists, whose deletion disconnects G and …

Abstract Let G=(V, E) G=(V, E) be a graph with the vertex-set V and the edge-set E. Let N (v)
denote the set of neighbors of the vertex v of G. The graph G is called irreducible whenever …

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 …

We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We
develop a general strategy for determining the quantum automorphism groups of such …

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 $ n $ and $ k $ be integers with $ n> k\geq1 $ and $[n]=\{1, 2,..., n\} $. The $
bipartite\Kneser\graph $$ H (n, k) $ is the graph with the all $ k $-element and all ($ nk $) …

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 …

Let $\Omega $ be a $ m $-set, where $ m> 1$, is an integer. The Hamming graph $ H (n, m)
$, has $\Omega^{n} $ as its vertex-set, with two vertices are adjacent if and only if they differ …

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 …