Publications (10) View all
-
Article: Reducibility of Eulerian Graphs and Digraphs
[show abstract] [hide abstract]
ABSTRACT: In this paper the concept of reducibility in graph theory has been introduced. The vertex reducibility and edge reducibility of eulerian graphs and eulerian digraphs have also studied.AAM. 01/2013; To appear. -
Article: Vertex Removable Cycles of Graphs and Digraphs
[show abstract] [hide abstract]
ABSTRACT: In this paper the vertex removable cycle are defined. If is a class of graphs (digraphs) satisfying certain property, , the cycle C in is called vertex removable if . The vertex removable cycles for Eulerian graphs and also for regular graphs(digraphs) has been characterized.CJMS. 01/2013; To appear. -
Article: On Removable Cycles of Graphs and Digraphs
[show abstract] [hide abstract]
ABSTRACT: In this paper we defined the removable cycle that, if I is a class of graphs, G∈I , the cycle C in G is called removable if G-E(C)∈I. The removable cycles in eulerian graphs have been studied. We characterized eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles have been introduced. Further, the even and odd removable cycles in eulerian graphs have also been studied. The necessary and sufficient conditions for regular graphs (digraphs) to have a removable cycles have been characterized. We also defined, the removable cycle class.CJMS. 01/2012; 1(1)(2012):20-26. -
Article: Characterization The Deletable set of vertices in the (p-3 ) Regular
[show abstract] [hide abstract]
ABSTRACT: In this paper we characterized the ( p - 3 )- regular graphs which have a 3−deletable and a 4−deletable set of vertices.TJMCS. 01/2011; Vol .3:156 – 164.. -
Article: Edge Extension of Graphs and Digraphs
[show abstract] [hide abstract]
ABSTRACT: In this paper, the concepts of edge(arc) extension of graphs(digraphs) and the edge(arc) extensible class of graphs(digraphs) have been introduced. The classes of regular and eulerian graphs(digraphs) which are not edge(arc) extensible classes have also been introduced. The concept of edge(arc) extensibility number has been introduced as well as the characterization of extensibility number of regular graphs(digraphs). Also the extensibility number of eulerian graphs(digraphs) has been characterized.TJMCS. 01/2011; Vol .3(No.1 (2011)):1-10..
