Vertex Removable Cycles of Graphs and Digraphs

Document Type : Research Articles

Authors

1 University of Thi-qar ‎College of Education for Pure Sciences

2 University of Thi-qar\‎ ‎College of Education for Pure Sciences

Abstract

‎In this paper we defined the vertex removable cycle in respect of the following‎, ‎if F is a class of graphs(digraphs)‎
‎satisfying certain property‎, ‎GinF‎, ‎the cycle C in G is called vertex removable if GV(C)ininF.‎
‎The vertex removable cycles of eulerian graphs are studied‎. ‎We also characterize the edge removable cycles of regular‎
‎graphs(digraphs).‎
 
 

Keywords