Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in

Options:
  Reset


Query: "author" (Simon Brezovnik) .

1 - 3 / 3
First pagePrevious page1Next pageLast page
1.
Generalized cut method for computing Szeged-like polynomials with applications to polyphenyls and carbon nanocones
Simon 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: 31
.pdf Full text (599,00 KB)

2.
Resonance graphs and a binary coding of perfect matchings of outerplane bipartite graphs
Simon 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
.pdf Full text (433,15 KB)

3.
Outerplane bipartite graphs with isomorphic resonance graphs
Simon 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
.pdf Full text (452,02 KB)
This document has many files! More...
Search done in 0.14 sec.
Back to top