Results 1 to 10 of about 982,672 (306)
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
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
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
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
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
On Eccentric Adjacency Index of Graphs and Trees [PDF]
Mathematics Interdisciplinary Research, 2023 Let $G=(V(G),E(G))$ be a simple and connected graph. The distance between any two vertices $x$ and $y$, denoted by $d_G(x,y)$, is defined as the length of a shortest path connecting $x$ and $y$ in $G$.The degree of a vertex $x$ in $G$, denoted by $\deg_G(
Reza Sharafdini +3 more
doaj +1 more source
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
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
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
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