Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...

Household Division of Labor, Partnerships and Children: Evidence from Europe This paper complements conventional economic analysis and presents a social norms interpretation to explain cross-country differences in partnership formation rates, and the dramatic decrease in partnership formation rates in Southern Europe in particular. We argue that increases in female human capital – by raising th...

To exploit effectively the mass of information available today on the Web, the key problem is that of content matching: the relevant information must be selected according to the user needs, independently of the vocabulary and the syntax used to express it. Content matching seems to be an intrinsic problem for textual documents or web pages: current information retrieval techniques either rely ...

This paper presents a mixed-method approach to measuring the functioning of Safe Schools/Healthy Students (SS/HS) Initiative partnerships. The SS/HS national evaluation team developed a survey to collect partners' perceptions of functioning within SS/HS partnerships. Average partnership functioning scores were used to rank each site from lowest to highest. Sites with the most favorable percepti...

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.

To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...

template matching is a widely used technique in many of image processing and machine vision applications. in this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to rotation, scale, translation and brightness (rstb) changes. for this purpose, we adopt the idea of ring projection transform (rpt) of image. in the proposed algorithm, two novel s...

The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...