#### Filter Results:

#### Publication Year

2010

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- B. Prashanth
- 2014

Chromatic number of a graph G is the minimum number of colors with which a graph can be colored properly and it is denoted by c (G). In this paper we are finding the chromatic number of S-Antipodal graph, also we discussed the chromatic number of different properties of S-Antipodal graph.

- B U V Prashanth, P Narahari Sastry, V Rajesh
- ArXiv
- 2013

In this manuscript we present the technique to detect and analyze the DNA rich structure in Haemotoxylin&Eosin (H&E) image of a tissue treated with anti CD4 green antigen. The detection of DNA rich structure can be considered as a detection of blue nuclei present through the biomedical signal/image processing technique performed on the image of the tissue… (More)

- P. Siva Kota Reddy, B. Prashanth
- 2013

A Smarandachely k-signed digraph (Smarandachely k-marked digraph) is an ordered pair S = (D, σ) (S = (D, µ)) where D = (V, A) is a digraph called underlying digraph of S and σ : A → e k)) is a function, where each ei ∈ {+, −}. Particularly, a Smarandachely 2-signed digraph or Smarandachely 2-marked digraph is called abbreviated a signed digraph or a marked… (More)

Adverse drug reactions (ADR) are an expression that describes harm associated with the use of medications at therapeutic dose. Traditional medicines also can develop ADRs due to their improper use. Shvitrahara Varti, one of such medicines holds Bakuchi as a component and is to be used judiciously. Furanocoumarins like psoralen present in Bakuchi makes skin… (More)

- P. Siva, Kota Reddy, B. Prashanth
- 2013

In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems. For standard terminology and notion in graph theory we refer the reader to Harary [2]; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates. The line graph… (More)

- P. Siva Kota Reddy, B. Prashanth, V. Lokesha
- 2013

A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ) (S = (G, µ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, · · · , e k) (µ : V → (e1, e2, · · · , e k)) is a function, where each ei ∈ {+, −}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called… (More)

- B U V Prashanth
- 2013

This paper illustrates the system on chip (SoC) debugging and analyses its behavior at several test conditions by verifying the functional aspects of the on-chip bus. Here an Advanced High performance bus (AHB) is selected, since the AHB bus signals are difficult to observe as they are deeply embedded in the system on chip and these I/O pins to access these… (More)

- B. U. V. Prashanth, Y. Pandurangaiah
- ArXiv
- 2013

This manuscript aims to generate a secret key for a PHY layer to evaluate the channel characteristics in wireless communications. An algorithmic approach is adopted for multimedia encryption to generate a secret key between two entities communicating with each other in a real time simulation environment such as MATLAB. Two classes of PHY key generation… (More)

- S. Ramasamy, B. Venkataramani, C.K. Rajkumar, B. Prashanth, K. Krishna Bharath
- 2010 International Conference on Signal and Image…
- 2010

DAC architectures reported in the literature use segmentation schemes involving more thermometer and less binary bits, in order to guarantee a better dynamic and static performance. In this paper, a novel technique is proposed to minimize the glitch in the binary section of a segmented current steering DAC through the custom design of latches. This enables… (More)

- ‹
- 1
- ›