Iskanje po katalogu digitalne knjižnice

Opis: The Graovac-Pisanski index, also called the modified Wiener index, was introduced in 1991 and represents an extension of the original Wiener index, because it considers beside the distances in a graph also its symmetries. Similarly as Wiener in 1947 showed the correlation of the Wiener indices of the alkane series with the boiling points, in 2018 the connection between the GraovacPisanski index and the melting points of some hydrocarbon molecules was established. In this paper, we prove that the Graovac-Pisanski index of any connected bipartite graph as well as of any connected graph on an even number of vertices is an integer number. These results are applied to some important families of hydrocarbon molecules. By using a computer programme, the graphs with a non-integer Graovac-Pisanski index on at most nine vertices are counted. Finally, an infinite class of unicyclic graphs with a non-integer Graovac-Pisanski index is described.
Ključne besede: modified Wiener index, Graovac-Pisanski index, graph distance, automorphism group, hydrocarbons, carbon nanostructures
Objavljeno v DKUM: 14.02.2025; Ogledov: 0; Prenosov: 4
Celotno besedilo (1,36 MB)
Gradivo ima več datotek! Več...

Ključne besede: daisy cube, fries number, peripherally 2-colorable, plane (weakly) elementary bipartite graph, resonance graph
Objavljeno v DKUM: 31.01.2025; Ogledov: 0; Prenosov: 1
Celotno besedilo (646,39 KB)
Gradivo ima več datotek! Več...

Opis: 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.
Ključne besede: graph theory, resonance graphs, bipartite graphs
Objavljeno v DKUM: 10.12.2024; Ogledov: 0; Prenosov: 11
Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Ključne besede: Szeged entropy, Mostar entropy, PI entropy, cut method, quotient graphs, sensitivity of a topological descriptor
Objavljeno v DKUM: 20.05.2024; Ogledov: 164; Prenosov: 15
Celotno besedilo (3,17 MB)
Gradivo ima več datotek! Več...

Opis: 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.
Ključne besede: graph theory, carbon nanocone, topological indices
Objavljeno v DKUM: 25.03.2024; Ogledov: 234; Prenosov: 5
Povezava na celotno besedilo