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.

The (t) property of some classes of graphs

In this note,the (t) properties of five class are studied. We proved that the classes of cographs and clique perfect graphs without isolated vertices satisfy the (2) property and the (3) property, but do not satisfy the (t) property for tis greater than equal to 4. The (t) properties of the planar graphs and the perfect graphss are also studied . we obtain a necessary and suffieient conditions for the trestled graph of index K to satisfy the (2) property

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.

Raman spectra of polymethyl methacrylate optical fibres excited by a 532 nm diode pumped solid state laser

Polymethyl methacrylate (PMMA) optical fibres are fabricated by a preform drawing process. The Raman spectra of PMMA fibres are recorded using a diode pumped solid state laser emitting at 532 nm and a CCD-spectrograph in the 400–3800 cm−1 range. The variation of the Raman intensity with the length of the optical fibre is studied. Investigations are carried out on the variation of FWHM of the Raman peak at 2957 cm−1 with the length of the optical fibre and pump power. The differential scattering cross section and gain coefficient of the Raman peak at 2957 cm−1 in PMMA are calculated in relation to that of toluene.

Raman spectra of polymethyl methacrylate optical fibres excited by a 532 nm diode pumped solid state laser

Polymethyl methacrylate (PMMA) optical fibres are fabricated by a preform drawing process. The Raman spectra of PMMA fibres are recorded using a diode pumped solid state laser emitting at 532 nm and a CCD-spectrograph in the 400–3800 cm−1 range. The variation of the Raman intensity with the length of the optical fibre is studied. Investigations are carried out on the variation of FWHM of the Raman peak at 2957 cm−1 with the length of the optical fibre and pump power. The differential scattering cross section and gain coefficient of the Raman peak at 2957 cm−1 in PMMA are calculated in relation to that of toluene

Overtone Spectra of 1,2-Dichloro-And Dibromo-Ethanes in the Near Infrared Region

The vibrational overtone spectra 0f the liquid phase 1,2-dichloroethane and 1,2-dibromoethane in the spectral regions of CH stretching local mode overtones corresponding to delta v CH= = 2 to delta v CH=5 are reported. The observed spectral features are assigned using the local mode model. LocaI mode frequencies WCH and diagonal local mode anharmonicities XCH are obtained from an analysis of the spectra. The local-local combinations observed are interpreted on the basis of a coupled CH oscillator model hamiltonian. Local-normal combinations show complex structures and their possible assignments are given.

Overtone spectra of styrene and polystyrene in the visible and near infrared regions

Vibrational overtone spectra of styrene (liquid) and polystyrene (solid), studied by the laser-induced thermal lens (for ΔV=6) and the conventional near infrared absorption (for ΔV=3–5) techniques, are reported. For polystyrene, the overtone energy-bond length correlation predicts that the aryl CH bonds are ∼0.0005 Å longer than that in benzene, while no such conclusions could be drawn on styrene. Thesp 3 CH overtones in polystyrene are observed on the low energy side of the aryl CH overtones.

Clique Irreducibility and Clique Vertex Irreducibility of Graphs

A graphs 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 is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irreducibility and clique irreducibility of graphs which are non-complete extended p-sums (NEPS) of two graphs are studied. We prove that if G(c) has at least two non-trivial components then G is clique vertex reducible and if it has at least three non-trivial components then G is clique reducible. The cographs and the distance hereditary graphs which are clique vertex irreducible and clique irreducible are also recursively characterized.

Studies on the Spectrum and the Energy of Graphs

Department of Mathematics, Cochin University of Science and Technology

Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs

The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The set of vertices in G with maximum (minimum) distance is the antimedian (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H such that G is the antimedian and J the median subgraphs of H, respectively, and that dH(G, J) = r. When both G and J are connected, G and J can in addition be made convex subgraphs of H.

Betweenness Centrality in Some Classes of Graphs

There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs.

Fair Sets of Some Classes of Graphs

Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kn e, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed