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 …

The page number of a directed acyclic graph is the minimum for which there is a topological
ordering of and a-coloring of the edges such that no two edges of the same color cross, ie …

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 $ k $-page upward book embeddings ($ k $ UBEs) of $ st $-graphs, that is, book
embeddings of single-source single-sink directed acyclic graphs on $ k $ pages with the …

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 …

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 …

A k-page upward book embedding (k UBE) of a directed acyclic graph G is a book
embeddings of G on k pages with the additional requirement that the vertices appear in a …

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 …