On the acyclic polynomial of the linear chain of hexagons

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On the acyclic polynomial of the linear chain of hexagons

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

On the acyclic polynomial of the linear chain of hexagons

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název statě ve sborníku

Aplimat 2015: 14th Conference on Applied Mathematics

ISBN

978-80-227-4314-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

682-689

Název nakladatele

Slovenská technická univezita v Bratislave

Místo vydání

Bratislava

Místo konání akce

Bratislava

Datum konání akce

3. 2. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—