Polarisation Agile Microstrip Array Antenna Element

A new microstrip antenna element is described which exhibits polarization agility. This is achieved by employing a T-slot radiator which is driven by the edge fields of a balanced microstrip line. The balanced line can support two propagating modes. namely. an even mode and an odd mode, and be switching between these modes. the orthogonal arms of the T-slot radiator are separately excited thus forming orthogonally polarized radiated fields. A nucrostrip patch antenna, which displays polarization agility using the sane mechanism, is also described

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.