Papers by Dr. Bibin K Jose
Crystal Research and Technology
The synthesis as well as the results of the investigations on the structure as well as properties... more The synthesis as well as the results of the investigations on the structure as well as properties ‐ thermal, mechanical, surface and nonlinear optical of semiorganic bisglycine lithium perchlorate (BGLP) single crystals are herein recorded. BGLP single crystal with dimensions 14× 3 × 2 mm3 has been synthesized and its structure and lattice parameters have been identified with the aid of X‐ray diffraction. The vibrational spectrum of BGLP has been investigated making use of FT‐IR and FT‐Raman spectra. Optical transmittance and absorption is examined by UV–vis spectroscopy with thickness 2 mm and it is shown that the crystal is highly transparent with a lower cut‐off of 287 nm. The optical bandgap is evaluated as 5.7 eV. The dielectric constant is found to show variations with frequency as well as temperature, which remains constant at high frequencies. Dielectric loss is found to decrease with the applied electric field. BGLP is manifested to be thermally stable up to 256 °C as revea...
We herein record the synthesis as well as the results of our investigations on the structure as w... more We herein record the synthesis as well as the results of our investigations on the structure as well as properties - thermal, mechanical, surface and nonlinear optical (NLO) - of semiorganic bisglycine lithium perchlorate (BGLP) single crystals. BGLP single crystal with dimensions 14× 3 × 2 mm3 has been synthesized and its structure and lattice parameters have been identified with the aid of X-ray diffraction. The vibrational spectrum of BGLP has been investigated making use of FT-IR and FT-Raman spectra. Dielectric constant of BGLP is found to show variations with frequency as well as temperature, which remains constant at high frequencies, the causes of which have been discussed. BGLP is manifested to be thermally stable up to 256ºC as revealed from thermogravimetric analyses. The two-dimensional nucleation mechanism in the growth of BGLP crystals have been understood from chemical etching studies. The potential applications of BGLP in optical switching is evident from its third o...
2022 4th International Conference on Inventive Research in Computing Applications (ICIRCA)
2022 International Conference on Edge Computing and Applications (ICECAA)
Journal of the Indian Chemical Society
2022 International Conference on Applied Artificial Intelligence and Computing (ICAAIC)
Discrete Applied Mathematics, 2013
Applicable Analysis and Discrete Mathematics, 2009
We solve several conjectures and open problems from a recent paper by Acharya [2]. Some of our re... more We solve several conjectures and open problems from a recent paper by Acharya [2]. Some of our results are relatives of the Nordhaus-Gaddum theorem, concerning the sum of domination parameters in hypergraphs and their complements. (A dominating set in H is a vertex set D X such that, for every vertex x? X\D there exists an edge E ? E with x ? E and E?D ??.) As an example, it is shown that the tight bound ??(H)+??(H) ? n+2 holds in hypergraphs H = (X, E) of order n ? 6, where H is defined as H = (X, E) with E = {X\E | E ? E}, and ?? is the minimum total cardinality of two disjoint dominating sets. We also present some simple constructions of balanced hypergraphs, disproving conjectures of the aforementioned paper concerning strongly independent sets. (Hypergraph H is balanced if every odd cycle in H has an edge containing three vertices of the cycle; and a set S X is strongly independent if |S?E|? 1 for all E ? E.).
Given an arbitrary non-empty subset M of vertices in a graph G = (V, E), each vertex u in G is as... more Given an arbitrary non-empty subset M of vertices in a graph G = (V, E), each vertex u in G is associated with the set f o M (u) = {d(u, v) : v ∈ M, u = v}, called its open M-distance-pattern. The graph G is called open distancepattern uniform (odpu-) graph if there exists a subset M of V (G) such that f o M (u) = f o M (v) for all u, v ∈ V (G) and M is called an open distance-pattern uniform (odpu-) set of G. The minimum cardinality of an odpu-set in G, if it exists, is called the odpu-number of G and is denoted by od(G). In this paper we characterize several odpu-graphs and constructed classes of odpu-graph products especially, join of two graphs, cartesian product, lexicographic Product and corona.
Uploads
Papers by Dr. Bibin K Jose