Photoacoustic spectrum of samarium phthalocyanine powder

Photoacoustic spectrum of samarium phthalocyanine powder is recorded and compared with previously reported UV–vis absorption spectra of the same dissolved in different liquid and solid host media. The Davidov splitting of Q band is observed in the PA spectrum but the two bands are overlapped considerably and the shorter wavelength band is more intense and dominating one in the powder spectrum.

Studies on some graph operators and related topics

Department of Mathematics, Cochin University of Science and Technology

Studies on Some Graph Classes

Department of Mathematics, Cochin University of Science and Technology

Studies on some generalizations of line graph and the power domination problem in graphs

Department of Mathematics, Cochin University of Science and Technology

Multipole modes and spin features in the Raman spectrum of nanoscopic quantum rings

We present a systematic study of ground state and spectroscopic properties of many-electron nanoscopic quantum rings. Addition energies at zero magnetic field (B) and electrochemical potentials as a function of B are given for a ring hosting up to 24 electrons. We find discontinuities in the excitation energies of multipole spin and charge density modes, and a coupling between the charge and spin density responses that allow to identify the formation of ferromagnetic ground states in narrow magnetic field regions. These effects can be observed in Raman experiments, and are related to the fractional Aharonov-Bohm oscillations of the energy and of the persistent current in the ring

Ground-state self-consistent calculation of quantum dots under magnetic fields: Addition spectrum

A density-functional self-consistent calculation of the ground-state electronic density of quantum dots under an arbitrary magnetic field is performed. We consider a parabolic lateral confining potential. The addition energy, E(N+1)-E(N), where N is the number of electrons, is compared with experimental data and the different contributions to the energy are analyzed. The Hamiltonian is modeled by a density functional, which includes the exchange and correlation interactions and the local formation of Landau levels for different equilibrium spin populations. We obtain an analytical expression for the critical density under which spontaneous polarization, induced by the exchange interaction, takes place.

Isolation and characterization of broad spectrum bacteriophages lytic to Vibrio harveyi from shrimp farms of Kerala, India

Of 33 phages isolated from various shrimp farms in Kerala, India, six were segregated to have broad spectrum lytic efficiency towards 87 isolates of Vibrio harveyi with cross-infecting potential to a few other important aquaculture pathogens. They were further tested on beneficial aquaculture micro-organisms such as probiotics and nitrifying bacterial consortia and proved to be noninfective. Morphological characterization by transmission electron microscopy (TEM) and molecular characterization by RAPD and SDS-PAGE proved them distinct and positioned under Caudovirales belonging to Myoviridae and Siphoviridae

Strongly distance-balanced graphs and graph products

A graph G is strongly distance-balanced if for every edge uv of G and every i 0 the number of vertices x with d.x; u/ D d.x; v/ 1 D i equals the number of vertices y with d.y; v/ D d.y; u/ 1 D i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distancebalanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity O.mn/ for their recognition, wheremis the number of edges and n the number of vertices of the graph in question, are given

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

On The Center Sets and Center Numbers of Some Graph Classes

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes

The Li-like KLL-Auger spectrum of foil excitation Ne-projectiles

KLL-Auger transitions of the three electron system in Ne have been recorded in a coincidence experiment frec of contaminants from other systems. Energies as well as intensities are compared with calculated values.

Content aggregation on knowledge bases using graph clustering

Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper proposes the use of graph clustering techniques on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.