1. Extreme hollow hexagons with respect to the Mostar indexRoberto Cruz, Andrés Santamaría-Galvis, 2025, izvirni znanstveni članek Opis: The Mostar index of a connected graph is a well-known distance-based topologicalindex. Hollow hexagons are coronoid systems that represent coronoid hydrocarbons be-longing to the class of cycloarenes. They are formed by a single chain in a macro-cyclicarrangement consisting of linearly and angularly annelated hexagons, with exactly six an-gular hexagons. In this paper, we compute the Mostar index of hollow hexagons and findmaximal and minimal values of the Mostar index over the set of hollow hexagons with afixed number of hexagons.
Ključne besede: Mostar index, hollow hexagons, cut method, extremal values
Objavljeno v RUP: 26.09.2025; Ogledov: 223; Prenosov: 10
 Celotno besedilo (850,33 KB)
Gradivo ima več datotek! Več... |
2. |
3. |
4. |
5. Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing unitsChristian Trefftz, Andrés Santamaría-Galvis, Roberto Cruz Rodes, 2014, objavljeni znanstveni prispevek na konferenci Ključne besede: graph theory, graphics processing units, parallel algorithms, CUDA, Thrust library, interval graphs, maximal clique
Objavljeno v RUP: 18.10.2021; Ogledov: 2466; Prenosov: 25
 Povezava na celotno besedilo |
6. |
7. |
8. |
9. |
