|
|
|
|
Perfect Matchings in Edge-Transitive Graph
|
|
|
|
|
|
|
|
نویسنده
|
Marandi A. ,Nejah A. H. ,Behmaram A.
|
|
منبع
|
iranian journal of mathematical chemistry - 2014 - دوره : 5 - - کد همایش: - صفحه:27 -33
|
|
چکیده
|
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,v}), where pm(g) denotes the number of perfect matchings in g, g{u,v} is the graph constructed from g by deleting edges with an end vertex in {u,v} and uv ∈ e(g).
|
|
کلیدواژه
|
Perfect matchings ,edge-transitive graphs ,hypercube
|
|
آدرس
|
university of tehran, School of Mathematics, Statistics and Computer Science, ایران, university of tehran, School of Mathematics, Statistics and Computer Science, ایران, university of tabriz, Department of Mathematics, ایران. Institute for Research in Fundamental Science (IPM), School of Mathematics, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|