| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:A method for computing the edge-Hosoya polynomial with application to phenylenes
Authors:ID Knor, Martin (Author)
ID Tratnik, Niko (Author)
ID Tratnik, Niko (Corresponding author)
Files:URL http://dx.doi.org/10.46793/match.89-3.605K
 
.pdf RAZ_Knor_Martin_2023.pdf (525,57 KB)
MD5: 2278BEC23BA16128AD7FC1659D4FAA07
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
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
Article acceptance date:31.08.2022
Publisher:University of Kragujevac
Year of publishing:2023
Number of pages:str. 605-629
Numbering:ǂVol. ǂ89, ǂno. ǂ3
PID:20.500.12556/DKUM-87534 New window
UDC:519.17
ISSN on article:0340-6253
COBISS.SI-ID:142041603 New window
DOI:10.46793/match.89-3.605K New window
Publication date in DKUM:15.04.2024
Views:301
Downloads:188
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
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:ARRS - Slovenian Research Agency
Project number:P1-0383
Name:Kompleksna omrežja

Funder:ARRS - Slovenian Research Agency
Project number:J1-1692
Name:Barvanja, dekompozicije in pokritja grafov

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica