Perfect Matchings in Random Octagonal Chain Graphs
نویسندگان
چکیده
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn disjoint perfect tree-matchings in random graphs
For an arbitrary tree T, a T-matching in G is a set of vertex-disjoint subgraphs of G which are isomorphic to T. A T-matching which is a spanning subgraph of G is called a perfect T-matching. For any t-vertex tree T we find a threshold probability function jj = jj( n) for the existence of r edge-disjoint perfect T-matchings in a random graph G(n,p).
متن کاملMulticoloured Hamilton cycles and perfect matchings in pseudo-random graphs
Given 0 < p < 1, we prove that a pseudo-random graph G with edge density p and sufficiently large order has the following property: Consider any red/blue-colouring of the edges of G and let r denote the proportion of edges which have colour red. Then there is a Hamilton cycle C so that the proportion of red edges of C is close to r. The analogue also holds for perfect matchings instead of Hamil...
متن کاملAnnihilating random walks and perfect matchings of planar graphs
Annihilating random walks (ARW) have been studied in the early 70’s within the theory of interacting particles systems (see [1],[2],[3] and [9]). The idea was to study a system of particles moving on a graph according to certain laws of attraction. The system we study in this paper is defined as follows: the initial system consists of particles at every site of 2 . Then, each particle simultane...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2021
ISSN: 2314-4785,2314-4629
DOI: 10.1155/2021/2324632