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 $ 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 $\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 …

In this paper, a graph-theory-based approach for representing planar mechanisms is
presented, the Santiago Portilla method (SPM). From the corresponding adjacency matrix …

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 …

The Johnson graph $ J (n, i) $ is defined as the graph whose vertex set is the set of all $ i $-
element subsets of $\{1,..., n\} $, and two vertices are adjacent whenever the cardinality of …

Structural analysis is the primary stage in the design of any mechanical system, which
completely determines the effectiveness of its application in various fields of technology …

Let $\Gamma=(V, E) $ be a graph. The square graph $\Gamma^ 2$ of the graph $\Gamma $
is the graph with the vertex set $ V (\Gamma^ 2)= V $ in which two vertices are adjacent if …

Let $ G $ be a finite abelian group written additively with identity $0 $, and $\Omega $ be an
inverse closed generating subset of $ G $ such that $0\notin\Omega $. We say that $\Omega …