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.

Materials management in state transport undertakings in india with special reference to kerala state road transport corporation

Scientific studies on the materials management systems and practices actually followed in various organizations in India are rather limited. This is particularly true with respect to service industries. In this context ,the present study on the “materials management in state transport undertakings in India, with special reference to kerala state road corporation” assumes particular significance . This study, examines critically, the prevailing set up, procedures and practices of materials management in the Kerala state road transport corporation and compares them with the prevailing practices in other similar state transport undertakings. It indicates several areas for improvement with respect to the organization, materials planning, purchasing, store keeping and other aspects. It also seeks to develop a comprehensive inventory control system for KSRTC.

Management of Public Road Transport System in Trivandrum City

An efficient passenger road transport system is a boon to any city and an inefficient one its bane. Passenger bus transport operation involves various aspects like passenger convenience, profitability of operation and social, technological and environmental factors. The author’s interest in this area was aroused when he conducted a traffic survey of Trivandrum City in 1979. While some studies on the performance of the Kerala State Road Transport Corporation in specific areas like finance, inventory control etc. have already been made, no study has been made from the operational point of view. The study is also the first one of its kind in dealing with the transportation problems for a second order city like Trivandrum. The objective of this research study is to develop a scientific basis for analysing and understanding the various operational aspects of urban bus transport management like assessing travel demand, depot location, fleet allocation, vehicle scheduling, maintenance etc. The operation of public road transportation in Trivandrum City is analysed on the basis of this theoretical background. The studies made have relevance to any medium sized city in India or even abroad. If not properly managed, deterioration of any public utility system is a natural process and it adversely affects the consumers, the economy and the nation. Making any system more efficient requires careful analysis, judicious decision making and proper implementation. It is hoped that this study will throw some light into the various operational aspects of urban passenger road transport management which can be of some help to make it perform more efficiently

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.