Computing bounds for the general sum-connectivity index of some graph operations

dc.contributor.author	Akhter, S.
dc.contributor.author	Farooq, R.
dc.date.accessioned	2023-03-03T19:27:44Z
dc.date.available	2023-03-03T19:27:44Z
dc.date.issued	2020
dc.identifier.citation	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 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	DOI:10.12958/adm281
dc.identifier.other	2010 MSC: 05C76, 05C07.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188511
dc.description.abstract	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.	uk_UA
dc.description.sponsorship	This research is supported by the Higher Education Commission of Pakistan under grant No. 20-3067/NRPU /R&D/HEC/12.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Computing bounds for the general sum-connectivity index of some graph operations	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA