Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
Computing bounds for the general sum-connectivity index of some graph operations
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
Computing bounds for the general sum-connectivity index of some graph operations
Інший ID:
DOI:10.12958/adm281
2010 MSC: 05C76, 05C07.
2010 MSC: 05C76, 05C07.
Посилання:
Computing bounds for the general sum-connectivity index of some graph operations / S. Akhter, R. Farooq // Algebra and Discrete Mathematics. — 2020. — Vol. 29, № 2. — С. 147–160. — Бібліогр.: 20 назв. — англ.
Підтримка:
This research is supported by the Higher Education Commission of Pakistan under grant No. 20-3067/NRPU /R&D/HEC/12.
Дата:
2020
Переглядів:
269
Завантажень:
111
Анотація:
In this paper, we compute the bounds for general sum-connectivity index of several graph operations. These operations include corona product, cartesian product, strong product, composition, join, disjunction and symmetric difference of graphs. We apply the obtained results to find the bounds for the general sum-connectivity index of some graphs of general interest.
