The P3 Intersection Graph

We define a new graph operator called the P3 intersection graph, P3(G)- the intersection graph of all induced 3-paths in G. A characterization of graphs G for which P-3 (G) is bipartite is given . Forbidden subgraph characterization for P3 (G) having properties of being chordal , H-free, complete are also obtained . For integers a and b with a > 1 and b > a - 1, it is shown that there exists a graph G such that X(G) = a, X(P3( G)) = b, where X is the chromatic number of G. For the domination number -y(G), we construct graphs G such that -y(G) = a and -y (P3(G)) = b for any two positive numbers a > 1 and b. Similar construction for the independence number and radius, diameter relations are also discussed.

SOME NEW INTEGRAL GRAPHS

The eigenvalue of a graph is the eigenvalue of its adjacency matrix . A graph G is integral if all of its cigenvalues are integers. In this paper some new classes of integral graphs are constructed.

Studies in the geometry of the discrete plane

This thesis is an attempt to initiate the development of a discrete geometry of the discrete plane H = {(qmxo,qnyo); m,n e Z - the set of integers}, where q s (0,1) is fixed and (xO,yO) is a fixed point in the first quadrant of the complex plane, xo,y0 ¢ 0. The discrete plane was first considered by Harman in 1972, to evolve a discrete analytic function theory for geometric difference functions. We shall mention briefly, through various sections, the principle of discretization, an outline of discrete a alytic function theory, the concept of geometry of space and also summary of work done in this thesis

Pauli distorted double folded potential

The enhancement in the production of even-Z nuclei observed in nuclear fission has also been observed in fragments produced from heavy ion collsions. Beams of 40Ar, 40Cl, and 40Ca at 25 MeV/nucleon were impinged on 58Fe and 58Ni targets. The resulting fragments were detected using the MSU 4pi detector array, which had additional silicon detectors for better isotopic resolution. Comparison of the ratios of yields for each element showed enhancement of even-Z fragment production. The enhancement was more pronounced for reactions with a greater difference in the N/Z of the compound system. However, this effect was less for systems that were more neutron rich. The average N/Z for fragments also displayed an odd-even effect with a lower average N/Z for the even-Z fragments. This is related to the greater availability of neutron-poor isotopes for even-Z nuclei

Hypernuclear structure with the new Nijmegen potentials

Information on level density for nuclei with mass numbers A?20250 is deduced from discrete low-lying levels and neutron resonance data. The odd-mass nuclei exhibit in general 47 times the level density found for their neighboring even-even nuclei at the same excitation energy. This excess corresponds to an entropy of ?1.7kB for the odd particle. The value is approximately constant for all midshell nuclei and for all ground state spins. For these nuclei it is argued that the entropy scales with the number of particles not coupled in Cooper pairs. A simple model based on the canonical ensemble theory accounts qualitatively for the observed properties.

On the remoteness function in median graphs

A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function associates to each vertex x 2 V.G/ the sum of distances from x to the vertices in the profile. Starting from some nice and useful properties of the remoteness function in hypercubes, the remoteness function is studied in arbitrary median graphs with respect to their isometric embeddings in hypercubes. In particular, a relation between the vertices in a median graph G whose remoteness function is maximum (antimedian set of G) with the antimedian set of the host hypercube is found. While for odd profiles the antimedian set is an independent set that lies in the strict boundary of a median graph, there exist median graphs in which special even profiles yield a constant remoteness function. We characterize such median graphs in two ways: as the graphs whose periphery transversal number is 2, and as the graphs with the geodetic number equal to 2. Finally, we present an algorithm that, given a graph G on n vertices and m edges, decides in O.mlog n/ time whether G is a median graph with geodetic number 2

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

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

Theoretical investigations of an annular elliptical ring microstrip antenna using Green‘s function technique

Analytical expressions for the Green’s function of an annular elliptical ring microstrip antenna (AERMA) are developed and reported. The modal, radiation and input impedance characteristics of the TM, modes are determined from these expressions. The resonant frequencies of odd modes are greater than that of the even modes for all TMnl modes (n = 1, 2, 3, ...) udke elliptical microstrip structures. The radiation pattern and input imedance curves of TMI2 mode on comparison with available experimental result shows good agreement whch provides an independent validation to this technique. The performance of the AERMA is then investigated as a function of thickness and substrate dielectric permittivity.

Asymptotics of number fields and the Cohen-Lenstra heuristics

We study the asymptotics conjecture of Malle for dihedral groups Dl of order 2l, where l is an odd prime. We prove the expected lower bound for those groups. For the upper bounds we show that there is a connection to class groups of quadratic number fields. The asymptotic behavior of those class groups is predicted by the Cohen-Lenstra heuristics. Under the assumption of this heuristic we are able to prove the expected upper bounds.

Computing Generators of Free Modules over Orders in Group Algebras

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Computations in Relative Algebraic K-Groups

Let G be finite group and K a number field or a p-adic field with ring of integers O_K. In the first part of the manuscript we present an algorithm that computes the relative algebraic K-group K_0(O_K[G],K) as an abstract abelian group. We solve the discrete logarithm problem, both in K_0(O_K[G],K) and the locally free class group cl(O_K[G]). All algorithms have been implemented in MAGMA for the case K = \IQ. In the second part of the manuscript we prove formulae for the torsion subgroup of K_0(\IZ[G],\IQ) for large classes of dihedral and quaternion groups.

Topics of divisibility

The set of integers forms a commutative ring whose elements admit a unique decomposition into primes. In this folder three lecture notes are bound, concerning topics, developed by dropping or replacing special properties of this most natural and most special ring. For short: investigated are groupoids w.r.t the interplay of multiplication - on the one hand - and divisibility, ideal decomposition and residuation, respectively, on the other hand.

El ideal administrativo, nueva visión de la gestión directiva

Las recientes crisis económicas que ha vivido el mundo nos llevan a hacer una reflexión en torno a las responsabilidades que tienen los dirigentes empresariales en los cambios económicos e incluso sociales que se están viviendo. Es por tanto el momento para hacer un análisis más profundo del aporte que la administración, como ciencia, ha hecho a la sociedad. Se ha identificado que la administración permite el desarrollo y crecimiento de un individuo, al tiempo que es un medio de crecimiento y desarrollo para una comunidad, una región y una cultura, lo que se convierte en una realidad indiscutible que nos lleva a reflexionar acerca del porqué, ocurren problemas como las quiebras, ausencia de recursos, y conflictos internos en las organizaciones. En esa medida, una reflexión puede ser que los ideales que ha venido liderando la administración han sido desvirtuados y apartados de una moral y ética empresarial que permita al directivo pensar en algo más que utilidades. Podría parecer extraño decir que la empresa y la acción gerencial deben ir más allá. Podríamos iniciar con el análisis de la obsolescencia de los ideales administrativos o incluso en la ausencia de ideales en la administración. Sobre si se está teniendo en cuenta que la administración que conocemos y aprendemos sigue vigente en un mundo que ha evolucionado y cambiado, el mundo de hoy es distinto al que conocimos incluso en nuestra época de formación profesional, pues se nos enseñó a pensar linealmente, causa y efecto, todo cumple un orden y un plan predeterminado, hoy la visión de certidumbre y control del hombre sobre las decisiones son guiadas por el azar, y por más que el hombre trabaja y diseña estrategias, éstas serán transformadas de acuerdo a las emergencias. Por lo anterior, es importante entender que para avanzar y dejar la obsolescencia en los ideales que ha definido la administración, los directivos deben cambiar su visón y entender la dinámica de interrelación de sus organizaciones en un mundo en permanente caos. Debemos estudiar desde dinámicas diferentes a la de funcionalidad, y saber que es momento para que la administración tenga una nueva visión de la gestión administrativa, por lo que debemos ampliar nuestro horizonte y ver a través de la complejidad. Las decisiones que toman los directivos, las estrategias que definen y la forma de relacionarse con la competencia en mercados altamente competitivos requiere de un cambio en la administración y de un marco ético muy distinto, debe concebirse la gestión directiva y administrativa para mantener y conservar la vida del sector, de la empresa y, por ende, mantener el medio que nos rodea. Por ello se propone ejercer la administración desde la bioética.

Exercise sheet 8

Exercises and solutions in LaTex