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 …

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

A graph Γ of order n> 2 is pancyclic if Γ contains a cycle of length l for each integer l with 3≤
l≤ n and it is called vertex-pancyclic if every vertex is contained in a cycle of length l for …

Abstract Let G=(V, E) be a graph with the vertex-set V and the edge set E. Let N (v) denotes
the set of neighbors of the vertex v of G. The graph G is called a vd-graph, if for every pare of …

A graph $ G $ of order $ n> 2$ is pancyclic if $ G $ contains a cycle of length $ l $ for each
integer $ l $ with $3\leq l\leq n $ and it is called vertex-pancyclic if every vertex is contained …