Harary et al. put forward the concept on minimum cardinality over all subsets of perfect matching M that are not included by any other ones, to be forcing number for M. A counting polynomial matchings possessing same was introduced Zhang al., using name `forcing polynomial'. This research deduces recurrence formulas polynomials monotonic constructable hexagonal systems and with one turning. Fro...

Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In +A. Applications include computing the rank of A, nding a maximum matching in T , computing the rank and determinant of the associated neighborhood matrix, and computing the characteristic polynomial of A.

The q-semicircular distribution is a probability law that interpolates between the Gaussian law and the semicircular law. There is a combinatorial interpretation of its moments in terms of matchings where q follows the number of crossings, whereas for the free cumulants one has to restrict the enumeration to connected matchings. The purpose of this article is to describe combinatorial propertie...

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a coalition of vertices is the weight of the maximum size matching in the subgraph induced by the coalition. The Shapley value is one of the most important solution c...

We consider a square matrix Aǫ whose entries have asymptotics of the form (Aǫ) ij = a ij ǫ A ij + o(ǫ A ij) when ǫ goes to 0, for some complex coefficients a ij and real exponents A ij. We look for asymptotics of the same type for the eigenvalues of Aǫ. We show that the sequence of exponents of the eigenvalues of Aǫ is weakly (super) majorized by the sequence of corners of the min-plus characte...

Let P(G;x,y) be the number of vertex colorings φ : V →{1, ...,x} of an undirected graph G = (V,E) such that for all edges {u,v} ∈ E the relations φ(u)≤ y and φ(v)≤ y imply φ(u) 6= φ(v). We show that P(G;x,y) is a polynomial in x and y which is closely related to Stanley’s chromatic symmetric function, and which simultaneously generalizes the chromatic polynomial, the independence polynomial, an...

We revisit the pairwise kidney exchange problem established by Roth Sonmez and Unver [23]. Our goal, explained in terms of graph theory, is to find a maximum fractional matching on an undirected graph, that Lorenz-dominates any other fractional matching. The Lorenz-dominant fractional matching, which can be implemented as a lottery of integral matchings, is in some sense the fairest allocation ...

This paper consists of two parts, both of which address stability of perfect matchings. In the first part we consider instances of the Stable Roommates problem that arise from geometric representation of participants preferences: a participant is a point in Euclidean space, and his preference list is given by sorted distances to the other participants. We observe that, unlike in the general cas...

Symmetric edge polytopes \(\mathcal{A}_G\) of type A are lattice arising from the root system \(A_n\) and finite simple graphs \(G\). There is a connection between Kuramoto synchronization model in physics. In particular, normalized volume plays central role. present paper, we focus on particular class graphs. fact, for any cactus graph \(G\), give formula \(h^*\)-polynomial \(\mathcal{A}_{\wid...

The cyclic ladder graph CLn is the Cartesian product of cycles Cn and paths P2, that CLn=Cn×P2, (n≥3). di-forcing polynomial a binary enumerative all perfect matching forcing anti-forcing numbers. In this paper, we derive recursive formulas for by classifying counting cases associated edges given vertex, from which obtain number matching, polynomials, generating function computing some polynomi...