Publication detail

On the Fibonacci numbers and F-polynomial of graphs

Authors: Seibert Jaroslav

Year: 2010

Type of publication: článek v odborném periodiku

Name of source: Scientific Papers of the University of Pardubice - Series D, Faculty of Economics and Administration

Publisher name: Univerzita Pardubice

Place: Pardubice

Page from-to: 243-249

Titles:

Language	Name	Abstract	Keywords
cze	Fibonacciova čísla a F-polynom grafů	F-polynom grafu je analogie párovacího polynomu. Základní vlastnosti a metody výpočtu F-polynomu jsou v tomto článku ukázány. Fibonacciovo číslo grafu, včetně jeho výpočtu pro jisté typy grafů, jsou tahé uvedeny.	Jednoduchý graf; párovací polynom; F-polynom; Fibonacciovo číslo
eng	On the Fibonacci numbers and F-polynomial of graphs	F-polynomial of a graph is an analogy of the matching polynomial. The basic properties and methods of calculation of F-polynomial are shown in this paper. The Fibonacci number of a graph, including its determination for certain types of graphs, is also mentioned.	Simple graph; matching polynomial; F-polynomial; Fibonacci number

Search