Nd:Glass Laser-Induced Damage To Thin Films, Two-Photon Excited Fluorescence And Plasma Studies

Laser-induced damage is the principal limiting constraint in the design and operation of high-power laser systems used in fusion and other high-energy laser applications. Therefore, an understanding of the mechanisms which cause the radiation damage to the components employed in building a laser and a knowledge of the damage threshold of these materials are of great importance in designing a laser system and to operate it without appreciable degradation in performance. This thesis, even though covers three distinct problems for investigations using a dye Q-switched multimode Nd:glass laser operating at 1062 nm and emitting 25 ns (FWHM) pulses, lays its main thrust on damage threshold studies on thin films. Using the same glass laser two-photon excited fluorescence in rhodamine 6G and generation and characterisation of a carbon plasma have also been carried out.

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.

Median graphs, the remoteness function, periphery transversals, and geodetic number two

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed