Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:A method for computing the edge-Hosoya polynomial with application to phenylenes
Authors:ID Knor, Martin (Author)
ID Tratnik, Niko (Author)
Files:.pdf PDF - Presentation file, download (530,53 KB)
MD5: C3CD3FE3F642081C3744FF6A89922310
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:The edge-Hosoya polynomial of a graph is the edge version of the famous Hosoya polynomial. Therefore, the edge-Hosoya polynomial counts the number of (unordered) pairs of edges at distance $k \ge 0$ in a given graph. It is well known that this polynomial is closely related to the edge-Wiener index and the edge-hyper-Wiener index. As the main result of this paper, we greatly generalize an earlier result by providing a method for calculating the edge-Hosoya polynomial of a graph $G$ which is obtained by identifying two edges of connected bipartite graphs $G_1$ and $G_2$. To show how the main theorem can be used, we apply it to phenylene chains. In particular, we present the recurrence relations and a linear time algorithm for calculating the edge-Hosoya polynomial of any phenylene chain. As a consequence, closed formula for the edge-Hosoya polynomial of linear phenylene chains is derived.
Keywords:edge-Hosoya polynomial, graphs, phenylenes
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2023
Year of publishing:2023
Number of pages:str. 605-629
Numbering:Vol. 89, no. 3
PID:20.500.12556/DiRROS-18448 New window
UDC:519.17
ISSN on article:0340-6253
DOI:10.46793/match.89-3.605K New window
COBISS.SI-ID:142041603 New window
Publication date in DiRROS:18.03.2024
Views:632
Downloads:444
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Match : communications in mathematical and in computer chemistry
Shortened title:Match
Publisher:University of Kragujevac, Faculty of Science
ISSN:0340-6253
COBISS.SI-ID:2624551 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Funding programme:Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Project number:P1-0383-2017
Name:Kompleksna omrežja

Funder:ARIS - Slovenian Research and Innovation Agency
Funding programme:Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Project number:J1-1692-2019
Name:Barvanja, dekompozicije in pokritja grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Funding programme:Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Project number:P1-0297-2022
Name:Teorija grafov

Back