Results 11 to 20 of about 577,160 (277)
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 +1 more source
Formalizing Randomized Matching Algorithms [PDF]
Logical Methods in Computer Science, 2012 Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning.
Dai Tri Man Le, Stephen A. Cook
doaj +1 more source
The Dual Polynomial of Bipartite Perfect Matching [PDF]
, 2020 We obtain a description of the Boolean dual function of the Bipartite Perfect Matching decision problem, as a multilinear polynomial over the Reals. We show that in this polynomial, both the number of monomials and the magnitude of their coefficients are
Beniamini, Gal
core +2 more sources
Low Weight Perfect Matchings [PDF]
The Electronic Journal of Combinatorics, 2020 Answering a question posed by Caro, Hansberg, Lauri, and Zarb, we show that for every positive integer $n$ and every function $\sigma\colon E(K_{4n})\to\{-1,1\}$ with $\sigma\left(E(K_{4n})\right)=0$, there is a perfect matching $M$ in $K_{4n}$with $\sigma(M)=0$.
Ehard, Stefan +2 more
openaire +3 more sources
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Journal of Chemistry, 2021 A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set ...
Muhammad Rizwan +3 more
doaj +1 more source
Polynomial reconstruction of the matching polynomial
Electronic Journal of Graph Theory and Applications, 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex ...
Xueliang Li, Yongtang Shi, Martin Trinks
doaj +1 more source
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
Perfect Matchings and Perfect Powers [PDF]
Journal of Algebraic Combinatorics, 2003 In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers. In this paper we present an approach that allows proving them in a unified way. We use this approach to prove a conjecture of James Propp stating that the number of tilings of the so-called Aztec
openaire +3 more sources
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 The 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.
Xia Wang +4 more
doaj +1 more source