应用与计算数学杂志

List of Graph Obtained from Folding a Graph

Abstract

Entesar Mohamed El-Kholy and H. Ahmed

In this paper we examining the relation between graph folding of a given graph and folding of new graphs obtained from this graph by some techniques like dual, gear, subdivision, web, crown, simplex, crossed prism and clique sum graphs. In each case, we obtained the necessary and sufficient conditions, if exist, for these new graphs to be folded. A simplex graph κ (G ) of an undirected graph G is itself a graph with a vertex for each clique in G . Two vertices of κ (G ) are joined by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex. The single vertices are called the zero vertices