On the acyclic polynomial of the linear chain of hexagons

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F15%3A39899248" target="_blank" >RIV/00216275:25410/15:39899248 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On the acyclic polynomial of the linear chain of hexagons
Original language description
The matching polynomial of an undirected simple graph G (without loops and multiple edges) was introduced by Farrell in 1979. He also gave basic properties of this polynomial. The acyclic polynomial of a graph is a special kind of the matching polynomial. This notion was developed by various authors during several years. Above all Gutman provided the mathematical principle of the acyclic polynomial of a graph. Two basic decomposition formulas are valid for the acyclic polynomial. These formulas are based on deletion of an edge or a vertex of a given graph. Especially, the edge decomposition formula is used for calculation of the acyclic polynomial of graphs in this contribution. Using this relation the acyclic polynomials of a path and a circuit on N vertices are expressed in a closed form. Further, the acyclic polynomial of the linear chain of hexagons is found as a function of the number of hexagons in the chain.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Aplimat 2015: 14th Conference on Applied Mathematics
ISBN
978-80-227-4314-3
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
682-689
Publisher name
Slovenská technická univezita v Bratislave
Place of publication
Bratislava
Event location
Bratislava
Event date
Feb 3, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)