A stochastic model for sero conversion times of HIV transmission

This paper focuses on the study of a Stochastic Model for predicting the seroconversion time of HIV transmission. As the immune capacities of an individual vary and also have its own resistance, the antigenic diversity threshold is different for different person. We propose a stochastic model to study the damage process acting on the immune system that is non- linear. The mean of seroconversion time of HIV and its variance are derived. A numerical example is given to illustrate the seroconversion times of HIV transmission

Monophonic Distance in Graphs

For any two vertices u and v in a connected graph G, a u − v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) is the length of a longest u − v monophonic path in G. For any vertex v in G, the monophonic eccentricity of v is em(v) = max {dm(u, v) : u ∈ V}. The subgraph induced by the vertices of G having minimum monophonic eccentricity is the monophonic center of G, and it is proved that every graph is the monophonic center of some graph. Also it is proved that the monophonic center of every connected graph G lies in some block of G. With regard to convexity, this monophonic distance is the basis of some detour monophonic parameters such as detour monophonic number, upper detour monophonic number, forcing detour monophonic number, etc. The concept of detour monophonic sets and detour monophonic numbers by fixing a vertex of a graph would be introduced and discussed. Various interesting results based on these parameters are also discussed in this chapter

The Total Open Monophonic Number of a Graph

For a connected graph G of order n >- 2, a subset S of vertices of G is a monophonic set of G if each vertex v in G lies on a x-y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G).  A  monophonic set of cardinality m(G) is called a m-set of G. A set S of vertices  of a connected graph G is an open monophonic set of G if for each vertex v  in G, either v is an extreme vertex of G and v ˆˆ? S, or v is an internal vertex of a x-y monophonic path for some x, y ˆˆ? S. An open monophonic set of minimum cardinality is a minimum open monophonic set and this cardinality is the open monophonic number, om(G). A connected open monophonic set of G is an open monophonic set S such that the subgraph < S > induced by S is connected. The minimum cardinality of a connected open monophonic set of G is the connected open monophonic number of G and is denoted by omc(G). A total open monophonic set of a graph G is an open monophonic set S such that the subgraph < S > induced by S contains no isolated vertices. The minimum cardinality of a total open monophonic set of G is the total open monophonic number of G and is denoted by omt(G). A total open monophonic set of cardinality omt(G) is called a omt-set of G. The total open monophonic  numbers of certain standard graphs are determined. Graphs with total open monphonic number 2 are characterized. It is proved that if G is a connected graph such that omt(G) = 3 (or omc(G) = 3), then G = K3 or G contains exactly two extreme vertices. It is proved that for any integer n  3, there exists a connected graph G of order n such that om(G) = 2, omt(G) = omc(G) = 3. It is proved that for positive integers r, d and k  4 with 2r, there exists a connected graph of radius r, diameter d and total open monophonic number k. It is proved that for positive integers a, b, n with 4 <_ a<_ b <_n, there exists  a connected graph G of order n such that omt(G) = a and omc(G) = b

Restrained Double Monophonic Number of a Graph

For a connected graph G of order at least two, a double monophonic set S of a graph G is a restrained double monophonic set if either S=V or the subgraph induced by V−S has no isolated vertices. The minimum cardinality of a restrained double monophonic set of G is the restrained double monophonic number of G and is denoted by dmr(G). The restrained double monophonic number of certain classes graphs are determined. It is shown that for any integers a,b,c with 3≤a≤b≤c, there is a connected graph G with m(G)=a, mr(G)=b and dmr(G)=c, where m(G) is the monophonic number and mr(G) is the restrained monophonic number of a graph G.The second author research work was supported by National Board for Higher Mathematics, INDIA (Project No. NBHM/R.P.29/2015/Fresh/157).The authors are thankful to the reviewers for their useful comments for the improvement of this paper

Pulsed microwave assisted hot air drying of nutmeg mace for better colour retention

A study was conducted on application of novel drying technology for better color retention of mace. Pulsed microwave assisted hot air drying was investigated at three different power levels 0.5 kW, 1 kW and 1.445 kW with 30 seconds pulsation at a hot air temperature of 45°C and the color values of mace were compared with the market and fresh sample using colorimeter. Further, the major flavor compound, myristicin in mace was analysed. &nbsp