1. Generalized cut method for computing Szeged-like polynomials with applications to polyphenyls and carbon nanoconesSimon Brezovnik, Niko Tratnik, 2023, original scientific article Abstract: Szeged, Padmakar-Ivan (PI), and Mostar indices are some of the most investigated distance-based Szeged-like topological indices. On the other hand, the polynomials related to these topological indices were also introduced, for example the Szeged polynomial, the edge- Szeged polynomial, the PI polynomial, the Mostar polynomial, etc. In this paper, we introduce a concept of the general Szeged-like polynomial for a connected strength-weighted graph. It turns out that this concept includes all the above mentioned polynomials and also infinitely many other graph polynomials. As the main result of the paper, we prove a cut method which enables us to efficiently calculate a Szeged-like polynomial by using the corresponding polynomials of strength-weighted quotient graphs obtained by a partition of the edge set that is coarser than ▫$\Theta^*$▫-partition. To the best of our knowledge, this represents the first implementation of the famous cut method to graph polynomials. Finally, we show how the deduced cut method can be applied to calculate some Szeged-like polynomials and corresponding topological indices of para-polyphenyl chains and carbon nanocones.
Keywords: graph theory, carbon nanocone, topological indices
Published in DiRROS: 20.03.2024; Views: 104; Downloads: 32
 Full text (599,00 KB) |
2. A method for computing the edge-Hosoya polynomial with application to phenylenesMartin Knor, Niko Tratnik, 2023, original scientific article 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
Published in DiRROS: 18.03.2024; Views: 88; Downloads: 30
Full text (530,53 KB) |
3. Resonance graphs and a binary coding of perfect matchings of outerplane bipartite graphsSimon Brezovnik, Niko Tratnik, Petra Žigert Pleteršek, 2023, original scientific article Abstract: The aim of this paper is to investigate resonance graphs of $2$-connected outerplane bipartite graphs, which include various families of molecular graphs. Firstly, we present an algorithm for a binary coding of perfect matchings of these graphs. Further, $2$-connected outerplane bipartite graphs with isomorphic resonance graphs are considered. In particular, it is shown that if two $2$-connected outerplane bipartite graphs are evenly homeomorphic, then its resonance graphs are isomorphic. Moreover, we prove that for any $2$-connected outerplane bipartite graph $G$ there exists a catacondensed even ring systems $H$ such that the resonance graphs of $G$ and $H$ are isomorphic. We conclude with the characterization of $2$-connected outerplane bipartite graphs whose resonance graphs are daisy cubes.
Keywords: graph theory, resonance graphs, bipartite graphs
Published in DiRROS: 18.03.2024; Views: 79; Downloads: 31
Full text (433,15 KB) |
4. Zhang-Zhang polynomials of phenylenes and benzenoid graphsNiko Tratnik, 2024, original scientific article Abstract: The aim of this paper is to study some variations of the Zhang-Zhang polynomial for phenylenes, which can be obtained as special cases of the multivariable Zhang-Zhang polynomial. Firstly, we prove the equality between the first Zhang-Zhang polynomial of a phenylene and the generalized Zhang-Zhang polynomial of some benzenoid graph, which enables us to prove also the equality between the first Zhang-Zhang polynomial and the generalized cube polynomial of the resonance graph. Next, some results on the roots of the second Zhang-Zhang polynomial of phenylenes are provided and another expression for this polynomial is established. Finally, we give structural interpretation for (partial) derivatives of different Zhang-Zhang polynomials.
Keywords: graph theory, resonance graphs, polynomials
Published in DiRROS: 18.03.2024; Views: 87; Downloads: 35
Full text (487,12 KB) |
5. Outerplane bipartite graphs with isomorphic resonance graphsSimon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Žigert Pleteršek, 2024, original scientific article Abstract: We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance graphs. Three additional characterizations are expressed in terms of resonance digraphs, via local structures of inner duals, as well as using distributive lattices on the set of order ideals of posets defined on inner faces of 2-connected outerplane bipartite graphs.
Keywords: distributive lattice, inner dual, isomorphic resonance graphs, order ideal, 2-connected outerplane bipartite graph
Published in DiRROS: 13.03.2024; Views: 93; Downloads: 55
Full text (452,02 KB)
This document has many files! More... |
