Journal Paper

Paper Information

video

sound

Persian Version

View:

307

Download:

66

Cites:

Information Journal Paper

Title

PERFECT MATCHINGS IN EDGE-TRANSITIVE GRAPHS

Pages

 Start Page 27 | End Page 33

Abstract

 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 Pm(G)=(2q/p)Pm(G\{u, n})where Pm(G) denotes the number of PERFECT MATCHINGs in G, G\{ u, n} is the graph constructed from G by deleting edges with an end vertex in {u, n} and unÎE(G).

Cites

  • No record.
  • References

  • No record.
  • Related Journal Papers

    Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops