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.

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.

Study on the determination of molecular distance in organic dye mixtures using dual beam thermal lens technique

A sensitive method based on the principle of photothermal phenomena to study the energy transfer processes in organic dye mixtures is presented. A dual beam thermal lens method can be very effectively used as an alternate technique to determine the molecular distance between donor and acceptor in fluorescein–rhodamine B mixture using optical parametric oscillator.

Women and political change in kerala since independence

even after 45 years of independence, it is seen that women are still left cum the periphery cnf the political process. Effective and meaningful participation of women in politics remains elusive for most of them. The representation of women in the state legislatures and in both Houses of Parliament has been very marginal. The percentage of women members in the LokSabha to the total membership of the body has never touched a two-digit figure so far. Within these 45 years, India could field only five women as Union Cabinet Ministers. In the case of the various states also, the position of women's participation in political activities is not very different. On the whole, it is seen that in independent India the role played by women in the electoral politics of the country or in the day to day activities of the different political parties is very" ineffective and insignificant. The present study was undertaken to make an assessment of women's involvement in the political process of Kerala since independence. This small state in the southernmost part of India claims ‘that it possesses certain. unique features in its social fabric that makes it different from the rest of the country as far as the place of women in society is concerned.

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

Equal opportunity networks, distance-balanced graphs, and Wiener game

Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2  dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced.

A STUDY ON POLITICAL CONSCIOUSNESS IN HINDI NOVELS SINCE 1960

HINDI

THE CHANGING CONCEPT OF POLITICAL VALUES IN THE HINDI NOVELS OF POST-SIXTIES

Hindi