#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2004

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Co-author

#### Journals and Conferences

Learn More

- K GOWRI NAVADA
- 2004

It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.

- K.C. Navada, K.C. Sekaran
- 2006 International Conference on Advanced…
- 2006

It is observed that during the evolution of species, reticulation is an important event and is very prevalent in several organisms. However, the analytical tools for the representation of these events are still under development. This is primarily because of the difficulty involved in detecting these reticulation events that have taken place during the… (More)

- K. Gowri Navada
- 2006

Here we give a necessary and sufficient condition for a Banach space to be separable. For a Banach space B over the complex field C, let C(R, B) denote the set of all continuous functions defined on the real line R taking values in B with the compact convergence topology. When B = C we write C(R) for C(R, C). For a function φ in C(R, B) let τ (φ) denote the… (More)

- K GOWRI NAVADA, Gowri Navada
- 2006

We show that in n-fold cartesian product, n ≥ 4, a related component need not be a full component. We also prove that when n ≥ 4, uniform boundedness of lengths of geodesics is not a necessary condition for boundedness of solutions of (1) for bounded function f .

- K.C. Navada, K. Chandra Sekaran, M. Geetha
- International Conference on Computational…
- 2007

For the construction of a phylogenetic network, it is essential to know if the new sequence that is being inserted is the result of mutations or due to events like recombinations. Recombination is a process of formation of new genetic sequences by piecing together segments of previously existing sequences [1][2]. Once it is determined that it is a… (More)

- K. GOWRI NAVADA
- 2008

We show that as in the case of n-fold Cartesian product for n ≥ 4, even in 3-fold Cartesian product, a related component need not be full component. Introduction and Preliminaries The purpose of this note is to answer two questions about good sets raised in [3] and [4] for the case n = 3.

- ‹
- 1
- ›