Algebra and Discrete Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Algebra Discrete Math.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Algebra and Discrete Mathematics, 2020, Volume 29, Issue 2, Pages 147–160
DOI: https://doi.org/10.12958/adm281
(Mi adm748)
 

This article is cited in 1 scientific paper (total in 1 paper)

RESEARCH ARTICLE

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

Sh. Akhter, R. Farooq

School of Natural Sciences, National University of Sciences and Technology, H-12 Islamabad, Pakistan
Full-text PDF (357 kB) Citations (1)
References:
Abstract: Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. Denote by $d_{G}(u)$ the degree of a vertex $u\in V(G)$. The general sum-connectivity index of $G$ is defined as $\chi_{\alpha}(G)=\sum_{u_{1}u_2\in E(G)}(d_{G}(u_1)+d_{G}(u_2))^{\alpha}$, where $\alpha$ is a real number. 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.
Keywords: general sum-connectivity index, Randić index, corona product, strong product, symmetric difference.
Funding agency Grant number
Higher Education Commission of Pakistan 20-3067/NRPU /R&D/HEC/12
This research is supported by the Higher Education Commission of Pakistan under grant No. 20-3067/NRPU /R$\&$D/HEC/12.
Received: 15.08.2016
Bibliographic databases:
Document Type: Article
MSC: 05C76, 05C07
Language: English
Citation: Sh. Akhter, R. Farooq, “Computing bounds for the general sum-connectivity index of some graph operations”, Algebra Discrete Math., 29:2 (2020), 147–160
Citation in format AMSBIB
\Bibitem{AkhFar20}
\by Sh.~Akhter, R.~Farooq
\paper Computing bounds for the general sum-connectivity index of some graph operations
\jour Algebra Discrete Math.
\yr 2020
\vol 29
\issue 2
\pages 147--160
\mathnet{http://mi.mathnet.ru/adm748}
\crossref{https://doi.org/10.12958/adm281}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000548734400002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85087610969}
Linking options:
  • https://www.mathnet.ru/eng/adm748
  • https://www.mathnet.ru/eng/adm/v29/i2/p147
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Algebra and Discrete Mathematics
    Statistics & downloads:
    Abstract page:76
    Full-text PDF :51
    References:29
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024