Show simple item record
dc.contributor.author |
Seibert, Jaroslav |
|
dc.date.accessioned |
2011-05-10T14:00:14Z |
|
dc.date.available |
2011-05-10T14:00:14Z |
|
dc.date.issued |
2010 |
|
dc.identifier |
Univerzitní knihovna (studovna) |
|
dc.identifier.issn |
1211 – 555X |
|
dc.identifier.uri |
http://hdl.handle.net/10195/38497 |
|
dc.description.abstract |
The theory of graph polynomials and their applications in several branches
of science was developed by many authors. Some of these polynomials are related to
the matching polynomial. The Fibonacci polynomial, shortly F-polynomial, is also an
analogy the matching polynomial. We show the basic properties and methods of
calculation of the F-polynomial. Furthermore, the Fibonacci number of a graph,
including its determination for certain types of graphs, is mentioned. |
eng |
dc.format |
p. 243-249 |
eng |
dc.language.iso |
eng |
|
dc.publisher |
Univerzita Pardubice |
cze |
dc.relation.ispartof |
Scientific papers of the University of Pardubice. Series D, Faculty of Economics and Administration. 17 (2/2010) |
eng |
dc.subject |
simple graph |
eng |
dc.subject |
matching polynomial |
eng |
dc.subject |
F-polynomial |
eng |
dc.subject |
fibonacci number |
eng |
dc.title |
On the fibonacci numbers and F-polynomial of graphs |
eng |
dc.type |
Article |
eng |
dc.peerreviewed |
yes |
eng |
dc.publicationstatus |
published |
eng |
This item appears in the following Collection(s)
Show simple item record
|
Search DSpace
Browse
-
All of DSpace
-
This Collection
My Account
|