Nazad
Keldysh Institute of Applied Mathematics
On the Sombor index of chemical trees
Žana Kovijanić Vukićević
Download
2021
We give sharp bounds on the Sombor index of chemical trees and characterize the cases of the equalities. We stated conjectures regarding second maximal chemical trees of order n with respect to Sombor index, when n ≡ 0(mod 3) and n ≡ 1(mod 3).
World Scientific Pub Co Pte Ltd
Enumeration of maximum matchings in the Hanoi graphs using matching polynomials
In this paper, we consider Tower of Hanoi graphs and study their matching properties. Explicit system of recurrences is derived for the matching polynomials of these graphs and their appropriate truncated variants. Consequently, we obtain exact formula for the numbers of maximum matchings in Hanoi graphs using matching polynomials, which is a new approach for old one problem.
Download 2022 Žana Kovijanić Vukićević
Keldysh Institute of Applied Mathematics
On the Sombor index of chemical trees
We give sharp bounds on the Sombor index of chemical trees and characterize the cases of the equalities. We stated conjectures regarding second maximal chemical trees of order n with respect to Sombor index, when n ≡ 0(mod 3) and n ≡ 1(mod 3).
Download 2021 Žana Kovijanić Vukićević
Advanced Search
Reset
Partners
Subscribe to repository
EmpowerHR4Inno project is implemented at the Faculty for International Economics, Finance and Business and sponsored through IPA grant sheme „Scientific potential in support of innovation development“, CFCU/MNE/212, call reference EuropeAid/172-351/ID/ACT/ME. This website was created and maintained with the financial support of the Ministry of Education, Science and Innovation in Montenegro, Ministry of Finance in Montenegro and Delegation European Union. Its contents are the sole responsibility of Faculty for International Economics, Finance and Business UDG and do not necessarily reflect the views of the European Union.
Copyright © 2024 EmpowerHR4Inno. All right reserved.
Copyright © 2024 EmpowerHR4Inno. All rights reserved.