B. U. V. Prashanth

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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)
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)
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)
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)
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)
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)
  • 1