Results 1 to 10 of about 67,343 (164)
Nanophotonics, 2021 Coherent perfect absorption (CPA) describes the absence of all outgoing modes from a lossy resonator, driven by lossless incoming modes. Here, we show that for nanoresonators that also exhibit radiative losses, e.g., plasmonic nanoantennas, a generalized
Grimm Philipp +3 more
doaj +2 more sources
Perfect Matchings with Crossings [PDF]
Algorithmica, 2022 Abstract For sets of n points, n even, in general position in the plane, we consider straight-line drawings of perfect matchings on them. It is well known that such sets admit at least
Oswin Aichholzer +7 more
openaire +8 more sources
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)↦V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v).
Isaac Armando Reiter, Ju Zhou
doaj +1 more source
Theory and Applications of Graphs, 2022 Given an edge-colored complete graph Kn on n vertices, a perfect (respectively, near-perfect) matching M in Kn with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors.
Shuhei Saitoh, Naoki Matsumoto, Wei Wu
doaj +1 more source
Fractional matching preclusion for generalized augmented cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +1 more source
Families with no perfect matchings [PDF]
Combinatorial Theory, 2021 We consider families of $k$-subsets of $\{1, \dots, n\}$, where $n$ is a multiple of $k$, which have no perfect matching. An equivalent condition for a family $\mathcal{F}$ to have no perfect matching is for there to be a blocking set, which is a set of $b$ elements of $\{1, \dots, n\}$ that cannot be covered by $b$ disjoint sets in $\mathcal{F}$.
openaire +5 more sources
Conditional Matching Preclusion Number of Graphs
Discrete Dynamics in Nature and Society, 2023 The conditional matching preclusion number of a graph G, denoted by mp1G, is the minimum number of edges whose deletion results in the graph with no isolated vertices that has neither perfect matching nor almost-perfect matching.
Yalan Li, Shumin Zhang, Chengfu Ye
doaj +1 more source
Perfect Matching Preservers [PDF]
The Electronic Journal of Combinatorics, 2006 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.
Richard A. Brualdi +2 more
openaire +2 more sources
On perfect matchings in matching covered graphs [PDF]
Journal of Graph Theory, 2018 AbstractA graph is matching‐covered if every edge of is contained in a perfect matching. A matching‐covered graph is strongly coverable if, for any edge of , the subgraph is still matching‐covered. An edge subset of a matching‐covered graph is feasible if there exist two perfect matchings and such that , and an edge subset with at least two ...
Jinghua He +3 more
openaire +2 more sources
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance [PDF]
Communications in Combinatorics and Optimization, 2019 Given an undirected network $G(V,A,\mathbf{c})$ and a perfect matching $M$ of $G$, the inverse maximum perfect matching problem consists of modifying minimally the elements of $\mathbf{c}$ so that $M$ becomes a maximum perfect matching with respect to ...
J. Tayyebi
doaj +1 more source