Ars Combinatoria · 2008 · 21 citations · 5 references
Natural SciencesComputer ScienceMathematicsAlgebraCombinatoricsTheory Of ComputationCombinatorial Number TheoryEnumerative CombinatoricsGraph AlgorithmsGraph TheoryRecurrence RelationsAlgebraic Graph TheoryBipartite Graph MatricesBipartite NetworksRecurrence
In this paper, we consider the relationships between the sums of the Fibonacci and Lucas numbers and 1-factors of bipartite graphs. 1. Introduction The Fibonacci sequence, fFng ; is de ned by the recurrence relation, for n > 2 Fn = Fn 1 + Fn 2 where F1 = F2 = 1: The Lucas Sequence, fLng ; is de ned by the recurrence relation, for n > 2 Ln = Ln 1 + Ln 2 where L1 = 1; L2 = 3: The permanent of an n-square matrix A = (aij) is de ned by
5
Permanents of (0, 1)-Circulants
Henryk Minc · Canadian Mathematical Bulletin · 1964 · 43 citations · Full text
Determinants, Permanents and Bipartite Graphs
Frank Harary · Mathematics Magazine · 1969 · 36 citations