Perfect Matching Preservers
Copyright policy )Perfect Matching Preservers
For two bipartite graphs $G$ and $G'$, a bijection $\psi: E(G) \rightarrow E(G')$ is called a (perfect) matching preserver provided that $M$ is a perfect matching in $G$ if and only if $\psi(M)$ is a perfect matching in $G'$. We characterize bipartite graphs $G$ and $G'$ which are related by a matching preserver and the matching preservers between them.
- Charles University Czech Republic
- University of Wisconsin–Oshkosh United States
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graphs and linear algebra (matrices, eigenvalues, etc.), Directed graphs (digraphs), tournaments
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graphs and linear algebra (matrices, eigenvalues, etc.), Directed graphs (digraphs), tournaments
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!