Publication Type

Co-author

Journals and Conferences

The bondage number b(G) of a non empty graph G is the minimum number of edger whose removal from G results in a graph having domination number greater than the domination number of G. In this paper… (More)

Given positive integers k m n, a graphG of order n is ðk;mÞ-pancyclic if for any set of k vertices of G and any integer r with m r n, there is a cycle of length r containing the k vertices. Minimum… (More)

Our purpose is to introduce the concept of determining the smallest number of edges of a graph which can be oriented so that the resulting mixed graph has the trivial automorphism group. We find that… (More)

A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e. a hamiltonian path. Given a tournament T , it is well known that it… (More)

We consider only finite undirected graphs without loops or multiple edges. Notation or terms not defined here can be found in [1]. Let G be a graph and let S £; V( G). The subgraph (S) induced by S… (More)

In this talk, we consider a minimum degree condition for a hamiltonian graph to have a 2-factor with two components. Let G be a graph of order n ≥ 3. Dirac’s theorem says that if the minimum degree… (More)