On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

Patient matching in treatment for alcohol dependence: is the null hypothesis still alive and well?

In the light of Project MATCH, is it reasonable to accept the null hypothesis that there are no clinically signi® cant matching effects between patient characteristics and cognitive± behaviour therapy (CBT), motivational enhancement therapy (MET) and Twelve-Step facilitation therapy (TSF)? The Project MATCH investigators considered the null hypothesis but preferred the alternative hypothesis that further analysis may reveal combinations of patient and therapist characteristics that show more substantial matching effects than any of the variables that they have examined to date.1

Endogeneous matching in university-industry collaboration: Theory and empirical evidence from the UK

We develop a two-sided matching model to analyze collaboration between heterogeneousacademics and firms. We predict a positive assortative matching in terms of both scientificability and affinity for type of research, but negative assortative in terms of ability on one sideand affinity in the other. In addition, the most able and most applied academics and the mostable and most basic firms shall collaborate rather than stay independent. Our predictionsreceive strong support from the analysis of the teams of academics and firms that proposeresearch projects to the UK's Engineering and Physical Sciences Research Council.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

A new method for load matching in multimode microwave feating applicators based on the use of dielectric layer superposition

Usage of a dielectric multilayer around a dielectric Sample is studied as a means for improving the efficiency in multimode microwave- heating cavities. The results show that by using additional dielectric constant layers the appearance of undesired reflections at the sample-air interface is avoided and higher power -absorption rates within the sample and high -efficiency designs are obtained

Studies on some generalizations of line graph and the power domination problem in graphs

Department of Mathematics, Cochin University of Science and Technology

Median computation in graphs using consensus strategies

Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of pro¯les. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strategies on median computation in arbitrary graphs is discussed

A bidimensional model of matching in the marriage market with women labor decision

We construct a frictionless matching model of the marriage market where women have bidimensional attributes, one continuous (income) and the other dichotomous (home ability). Equilibrium in the marriage market determines intrahousehold allocation of resources and female labor participation. Our model is able to predict partial non-assortative matching, with rich men marrying women with low income but high home ability. We then perform numerical exercises to evaluate the impacts of income taxes in individual welfare and find that there is considerable divergence in the female labor participation response to taxes between the short run and the long run.

Tendências econômicas e sociais na América Latina e no Caribe em gráficos = Economic and social trends in Latin America and the Caribbean in graphs = Tendencias económicas y sociales en América Latina y el Caribe en gráficos

Incluye Bibliografía