Results 31 to 40 of about 622 (259)
On the kth Eigenvalues of Trees with Perfect Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
An Chang, Wai Chee Shiu
doaj +3 more sources
Annihilating random walks and perfect matchings of planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study annihilating random walks on $\mathbb{Z}$ using techniques of P.W. Kasteleyn and $R$. Kenyonon perfect matchings of planar graphs. We obtain the asymptotic of the density of remaining particles and the partition function of the underlying ...
Massimiliano Mattera
doaj +1 more source
Electronic Journal of Graph Theory and Applications, 2017 In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings and next investigate some of their properties.
Radosław Cymer
doaj +1 more source
Generalized Matching Preclusion in Bipartite Graphs
Theory and Applications of Graphs, 2018 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler +4 more
doaj +1 more source
Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Consider a set $S$ of points in the plane in convex position, where each point has an integer label from $\{0,1,\ldots,n-1\}$. This naturally induces a labeling of the edges: each edge $(i,j)$ is assigned label $i+j$, modulo $n$.
József Balogh +2 more
doaj +1 more source
Almost all Steiner triple systems are almost resolvable
Forum of Mathematics, Sigma, 2020 We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).
Asaf Ferber, Matthew Kwan
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, 1987 Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown.
E. J. Farrell
doaj +1 more source
Classical Dimers on Penrose Tilings
Physical Review X, 2020 We study the classical dimer model on rhombic Penrose tilings, whose edges and vertices may be identified as those of a bipartite graph. We find that Penrose tilings do not admit perfect matchings (defect-free dimer coverings).
Felix Flicker +2 more
doaj +1 more source
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Haglund, Jeffrey B. Remmel
openaire +2 more sources
Bichromatic Perfect Matchings with Crossings
, 2023 Appears in the Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)
Oswin Aichholzer +4 more
openaire +2 more sources