Computing bounds for the general sum-connectivity index of some graph operations
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...
Збережено в:
| Видавець: | Інститут прикладної математики і механіки НАН України |
|---|---|
| Дата: | 2020 |
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2020
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/188511 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Цитувати: | 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 назв. — англ. |
Репозиторії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | 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. |
|---|