On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups
The computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking. A subset [Formula: see text] of non-negative integers [Formula: see text] is called a numerical semigroup...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2425025 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849233344763527168 |
|---|---|
| author | Ying Wang Anam Shahzadi Muhammad Ahsan Binyamin Maria Mehtab Fairouz Tchier Adnan Aslam |
| author_facet | Ying Wang Anam Shahzadi Muhammad Ahsan Binyamin Maria Mehtab Fairouz Tchier Adnan Aslam |
| author_sort | Ying Wang |
| collection | DOAJ |
| description | The computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking. A subset [Formula: see text] of non-negative integers [Formula: see text] is called a numerical semigroup if it is a submonoid of [Formula: see text] and has a finite complement in [Formula: see text]. The graph associated with numerical semigroup [Formula: see text] is denoted by [Formula: see text] and is defined by the vertex set [Formula: see text] and the edge set [Formula: see text]. In this article, we compute the clique number and the minimum degree of those graphs, which can be associated with symmetric numerical semigroups of embedding dimension 2. Moreover, on this basis, we give some bounds for the atom-bond sum-connective index of graphs [Formula: see text] in terms of the harmonic index, the first Zagreb index, the sum-connectivity index, the maximum degree, the minimum degree, the chromatic number, and the clique number. |
| format | Article |
| id | doaj-art-abfc2b24c0cd4d2081004307040075c9 |
| institution | Kabale University |
| issn | 0972-8600 2543-3474 |
| language | English |
| publishDate | 2025-05-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj-art-abfc2b24c0cd4d2081004307040075c92025-08-20T06:46:13ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742025-05-0122212513510.1080/09728600.2024.2425025On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroupsYing Wang0Anam Shahzadi1Muhammad Ahsan Binyamin2Maria Mehtab3Fairouz Tchier4Adnan Aslam5School of Mathematics and Information Science, Guangzhou University, Guangzhou, ChinaDepartment of Mathematics, Government College University, Faisalabad, PakistanDepartment of Mathematics, Government College University, Faisalabad, PakistanDepartment of Mathematics, Government College University, Faisalabad, PakistanMathematics Department, College of Science, King Saud University, Riyadh, Saudi ArabiaDepartment of Natural Sciences and Humanities, University of Engineering and Technology, Lahore(RCET), PakistanThe computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking. A subset [Formula: see text] of non-negative integers [Formula: see text] is called a numerical semigroup if it is a submonoid of [Formula: see text] and has a finite complement in [Formula: see text]. The graph associated with numerical semigroup [Formula: see text] is denoted by [Formula: see text] and is defined by the vertex set [Formula: see text] and the edge set [Formula: see text]. In this article, we compute the clique number and the minimum degree of those graphs, which can be associated with symmetric numerical semigroups of embedding dimension 2. Moreover, on this basis, we give some bounds for the atom-bond sum-connective index of graphs [Formula: see text] in terms of the harmonic index, the first Zagreb index, the sum-connectivity index, the maximum degree, the minimum degree, the chromatic number, and the clique number.https://www.tandfonline.com/doi/10.1080/09728600.2024.2425025Numerical semigroupclique numberchromatic numberatom bond sum connectivity index05C2516U60 |
| spellingShingle | Ying Wang Anam Shahzadi Muhammad Ahsan Binyamin Maria Mehtab Fairouz Tchier Adnan Aslam On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups AKCE International Journal of Graphs and Combinatorics Numerical semigroup clique number chromatic number atom bond sum connectivity index 05C25 16U60 |
| title | On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups |
| title_full | On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups |
| title_fullStr | On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups |
| title_full_unstemmed | On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups |
| title_short | On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups |
| title_sort | on bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups |
| topic | Numerical semigroup clique number chromatic number atom bond sum connectivity index 05C25 16U60 |
| url | https://www.tandfonline.com/doi/10.1080/09728600.2024.2425025 |
| work_keys_str_mv | AT yingwang onboundsfortheatombondsumconnectivityindexofgraphsassociatedwithsymmetricnumericalsemigroups AT anamshahzadi onboundsfortheatombondsumconnectivityindexofgraphsassociatedwithsymmetricnumericalsemigroups AT muhammadahsanbinyamin onboundsfortheatombondsumconnectivityindexofgraphsassociatedwithsymmetricnumericalsemigroups AT mariamehtab onboundsfortheatombondsumconnectivityindexofgraphsassociatedwithsymmetricnumericalsemigroups AT fairouztchier onboundsfortheatombondsumconnectivityindexofgraphsassociatedwithsymmetricnumericalsemigroups AT adnanaslam onboundsfortheatombondsumconnectivityindexofgraphsassociatedwithsymmetricnumericalsemigroups |