ویراساینس.
سند علمی

Perfect Matchings of Line Graphs with Small Maximum Degree

WEIGEN YAN, FUJI ZHANG

چکیده

Let G be a connected graph with vertex set V (G) = {v1, v2, · · · , vν} , which may have multiple edges but have no loops, and 2 ≤ dG(vi) ≤ 3 for i = 1, 2, · · · , ν, where dG(v) denotes the degree of vertex v of G. We show that if G has an even number of edges, then the number of perfect matchings of the line graph of G equals 2, where n is the number of 3-degree vertices of G. As a corollary, we prove that the number of perfect matchings of a connected cubic line graph with n vertices equals 2 if n > 4, which implies the conjecture by Lovász and Plummer holds for the connected cubic line graphs. As applications, we enumerate perfect matchings of the Kagomé lattices, 3.12.12 lattices, and Sierpinski gasket with dimension two in the context of statistical physics.

اسناد مشابه

  • The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence

    سند علمی۲۰۰۸Electr. J. Comb.Noga Alon, Shmuel Friedland

    We show that the number of perfect matching in a simple graph G with an even number of vertices and degree sequence d1, d2, . . . , dn is at most ∏ n i=1 (di!) 1 2di This bound is sharp if and only if G is a union of complete balanced bipartite graphs. 2000 Mathematics Subject Cl

  • Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

    سند علمی۲۰۱۷Discrete MathematicsCemil Dibek, Tinaz Ekim, Pinar Heggernes

    We determine the maximum number of edges that a claw-free graph can have, when its maximum degree and matching number are bounded. This is a famous problem that has been studied on general graphs, and for which there is a tight bound. The graphs achieving this bound contain in mo

  • Enumeration of Perfect Matchings in Graphs with Reflective Symmetry

    سند علمی۱۹۹۷J. Comb. Theory, Ser. AMihai Ciucu

    A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the

  • Acyclic Choosability of Graphs with Small Maximum Degree

    سند علمی۲۰۰۵WGDaniel Gonçalves, Mickaël Montassier

    A proper vertex coloring of a graph G = (V, E) is acyclic if G contains no bicolored cycle. A graph G is L-list colorable if for a given list assignment L = {L(v) : v ∈ V }, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V . If G is L-list colorable for e

  • Maximizing the Minimum and Maximum Forcing Numbers of Perfect Matchings of Graphs

    مقاله‌ی دسترسی آزاد۲۰۲۳Acta Mathematica Sinica['Qianqian Liu', 'Heping Zhang', '']

    Let G be a simple graph with 2n vertices and perfect matching. The forcing number f(G, M) of matching M is the smallest cardinality subset that contained in no other G. Among all matchings G, minimum maximum values are called numbers denoted by f(G) F (G), respectively. Then ≤ (G

  • Enumeration of Perfect Matchings of Graphs with Rotational Symmetry by Pfaffians

    سند علمی۲۰۰۶WEIGEN YAN

    Abstract. The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph G is said to be n-rotation symmetric if the cyclic group of order n is a subgroup of the automorphism group of G. The enumeration of