Results 81 to 90 of about 2,022 (201)
On the index of bicyclic graphs with perfect matchings
, 2004 Let B + (2k) be the set of all bicyclic graphs on 2k(k ¿ 2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with maximal index in B + (2k)
Feng Tian +5 more
core +1 more source
Klazar trees and perfect matchings
, 2010 Martin Klazar computed the total weight of ordered trees under 12 different notions of weight. The last and perhaps the most interesting of these weights, w12, led to a recurrence relation and an identity for which he requested combinatorial explanations.
Callan, David
core +1 more source
The rotation graphs of perfect matchings of plane bipartite graphs
, 1997 In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for
Zhang, HP, Zhang, FJ, 张福基
core +2 more sources
Fullerene graphs have exponentially many perfect matchings
, 2009 7 pages, 3 figures.International audienceA fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces.
Kral, Daniel +3 more
core +1 more source
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
Special Matrices, 2018 In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
Efficient gene orthology inference via large-scale rearrangements. [PDF]
Algorithms Mol Biol, 2023 Rubert DP, Braga MDV.
europepmc +1 more source
Counting Perfect Matchings in Dense Graphs Is Hard
, 2022 We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5].
Maalouly, Nicolas El, Wang, Yanheng
core
Counting Perfect Matchings In Dirac Hypergraphs
One of the foundational theorems of extremal graph theory is Dirac\u27s theorem, which says that if an n-vertex graph G has minimum degree at least n/2, then G has a Hamilton cycle, and therefore a perfect matching (if n is even).
Wang, Yiting +2 more
core
Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph
Dianxin kexue, 2014 To improve the feasibility of virtual node mapping，grounded on feasibility test theorem and node rank indicators used to measure node availability，the virtual network mapping iterative algorithm based on K-best perfect matchings of bipartite graph was ...
Jianjun Yu, Chunming Wu
doaj +2 more sources
Graphical condensation for enumerating perfect matchings
, 2005 The method of graphical condensation for enumerating perfect matchings was found by Propp (Theoret. Comput. Sci. 303 (2003) 267), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004) 29).
Yan, WG, Zhang, FJ, 张福基
core