Gutman, Ivan Perfect matchings in a class of bipartite graphs. (English) Zbl 0738.05064 Publ. Inst. Math., Nouv. Sér. 45(59), 11-15 (1989). Denote \(\{1,\dots,n\}\) the vertex set of the graph \(G\). Let \(I_ p=\{i_ 1,i_ 2,\dots i_{2p}\}\subset\{1,\dots,n\}\) and \(i_ j<i_{j+1}\). Denote \(G(n,I_ p)\) the graph having the edges \((1,2),(2,3),\dots,((n-1),n),(n,1)\) and \((i_ j,i_{2p-j+1})\), \(j=1,\dots,p\). The paper establishes some relations for the number of perfect matchings of \(G(n,I_ p)\). Reviewer: F.Juhasz (Budapest) Cited in 3 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:number of perfect matchings PDFBibTeX XMLCite \textit{I. Gutman}, Publ. Inst. Math., Nouv. Sér. 45(59), 11--15 (1989; Zbl 0738.05064) Full Text: EuDML