The Edge C4 Graph of a Graph

Abstract. The edge C4 graph E4(G) of a graph G has all the edges of Gas its vertices, two vertices in E4(G) are adjacent if their corresponding edges in G are either incident or are opposite edges of some C4. In this paper, characterizations for E4(G) being connected, complete, bipartite, tree etc are given. We have also proved that E4(G) has no forbidden subgraph characterization. Some dynamical behaviour such as convergence, mortality and touching number are also studied

GALLAI AND ANTI-GALLAI GRAPHS OF A GRAPH

Abstract. The paper deals with graph operators-the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be H-free for any finite graph H. The case of complement reducible graphs-cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.

Thermal lens spectrum of organic dyes using optical parametric oscillator

The wavelength dependence of thermal lens signal from organic dyes are studied using dual beam thermal lens technique. It is found that the profile of thermal lens spectrum widely differ from the conventional absorption spectrum in the case of rhodamine B unlike in the case of crystal violet. This is explained on the basis of varying contribution of nonradiative relaxations from the excited vibronic levels.

High resolution optogalvanic spectrum of N2-rotational structure of (11, 7) band in the first positive system

High resolution optogalvanic spectrum of the (11, 7) band in the first positive system of nitrogen molecule has been recorded from 17179 to 17376 cm- 1. Assignment of 432 rotational lines belonging to the 27 branches of this band has been carried out.

Thermal lens spectrum of organic dyes using optical parametric oscillator

The wavelength dependence of thermal lens signal from organic dyes are studied using dual beam thermal lens technique. It is found that the profile of thermal lens spectrum widely differ from the conventional absorption spectrum in the case of rhodamine B unlike in the case of crystal violet. This is explained on the basis of varying contribution of nonradiative relaxations from the excited vibronic levels.

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 generalizations of line graph and the power domination problem in graphs

Department of Mathematics, Cochin University of Science and Technology

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

Energies of some non-regular graphs

The energy of a graph G is the sum of the absolute values of its eigenvalues. In this paper, we study the energies of some classes of non-regular graphs. Also the spectrum of some non-regular graphs and their complements are discussed.

Preparation, Characterisation And Microwave Dielectric Properties Of Anbn-1o3n (N=5,6,8) Type Perovskite Compounds

The present study on the preparation , characterization and microwave dielectric properties of AnBn-1O3n (N=5,6,8) type perovskite compounds. The explored ceramics show dielectric constant between 11 and 54,quality factor in the range 2400 to 88900 GHz and Tf in the range -73 to +231ppm/0C.Most of the investigated cation deficient hexagonal perovskites show intermediate dielectric constant with high quality factors. This study gives a general introduction about material, scientific and technological aspects of DRs.Three important ,€r ,Q and Tf, used for the DR characterization are described. The relationship of the above parameters with the fundamental material characteristics is discussed. Different modes are excited when a DR is excited with suitable microwave spectrum of frequencies .A description of analytical determination of frequencies and construction of mode charts used for sample design and mode identification are also discussed. In this study several ceramics are developed for DR purposes, very little attention has been paid to grow the single crystals. It might be due to the fact that the difficulties and time involved in the growth of single crystals, big enough to function as microwave resonators make them expensive .However single crystals of these materials may have very high Q values. It is also possible that a better understanding of the dielectric properties in relation to the structure can be arrived using single crystals. Hence one of the future directions of dielectric resonator research should be to grow good quality single crystals of the above materials.

Spectral Characteristics of the Blood of Streptozotocin Diabetic Rats using Photoacoustic Technique

Optical absorption characteristics of rat blood affected by diabetes has been studied using photoacoustic (PA) technique. PA spectrum of blood depends on the molecular structure of haemoglobin. The peak value ratio ylQ increases with increase in the diabetic state. Externally added glucose to normal blood does not show any increase in y//3 ratio as seen in the diabetic condition . The increase in yl,8 ratio may be due to the decrease in DPG level and the resultant shift from R -> T conformation of majority of diabetic haemoglobin.

Clique Irreducibility of Some Iterative Classes of Graphs

In this paper, two notions, the clique irreducibility and clique vertex irreducibility are discussed. A graph G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and it is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G. It is proved that L(G) is clique irreducible if and only if every triangle in G has a vertex of degree two. The conditions for the iterations of line graph, the Gallai graphs, the anti-Gallai graphs and its iterations to be clique irreducible and clique vertex irreducible are also obtained.

On Distance Energy of Graphs

The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed.

A Note on Energy of Some Graphs

Eigenvalue of a graph is the eigenvalue of its adjacency matrix. The energy of a graph is the sum of the absolute values of its eigenvalues. In this note we obtain analytic expressions for the energy of two classes of regular graphs.