Independence number in graphs and its upper bounds
In this paper, we use the double counting method to find some upper bounds for the independence number of a simple graph in terms of its order, size and maximum degree. Moreover, we determine extremal graphs attaining equality in upper bounds. In addition, some lower bounds for the energy of g...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahid Bahonar University of Kerman
2025-01-01
|
| Series: | Journal of Mahani Mathematical Research |
| Subjects: | |
| Online Access: | https://jmmrc.uk.ac.ir/article_4505_fdb6fade91ea1ec0184e8529a0926823.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841560175837708288 |
|---|---|
| author | Farzad Shaveisi |
| author_facet | Farzad Shaveisi |
| author_sort | Farzad Shaveisi |
| collection | DOAJ |
| description | In this paper, we use the double counting method to find some upper bounds for the independence number of a simple graph in terms of its order, size and maximum degree. Moreover, we determine extremal graphs attaining equality in upper bounds. In addition, some lower bounds for the energy of graphs in terms of their size and maximum degree and the number of odd cycle, are determined. |
| format | Article |
| id | doaj-art-3ebe725b8f284f6fbbbc42be23b81d92 |
| institution | Kabale University |
| issn | 2251-7952 2645-4505 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Shahid Bahonar University of Kerman |
| record_format | Article |
| series | Journal of Mahani Mathematical Research |
| spelling | doaj-art-3ebe725b8f284f6fbbbc42be23b81d922025-01-04T19:30:18ZengShahid Bahonar University of KermanJournal of Mahani Mathematical Research2251-79522645-45052025-01-0114139940510.22103/jmmr.2024.23302.16224505Independence number in graphs and its upper boundsFarzad Shaveisi0Department of Mathematics, Faculty of Science, Razi University, Kermanshah, IranIn this paper, we use the double counting method to find some upper bounds for the independence number of a simple graph in terms of its order, size and maximum degree. Moreover, we determine extremal graphs attaining equality in upper bounds. In addition, some lower bounds for the energy of graphs in terms of their size and maximum degree and the number of odd cycle, are determined.https://jmmrc.uk.ac.ir/article_4505_fdb6fade91ea1ec0184e8529a0926823.pdfindependence numbermaximum degreeedgeenergy |
| spellingShingle | Farzad Shaveisi Independence number in graphs and its upper bounds Journal of Mahani Mathematical Research independence number maximum degree edge energy |
| title | Independence number in graphs and its upper bounds |
| title_full | Independence number in graphs and its upper bounds |
| title_fullStr | Independence number in graphs and its upper bounds |
| title_full_unstemmed | Independence number in graphs and its upper bounds |
| title_short | Independence number in graphs and its upper bounds |
| title_sort | independence number in graphs and its upper bounds |
| topic | independence number maximum degree edge energy |
| url | https://jmmrc.uk.ac.ir/article_4505_fdb6fade91ea1ec0184e8529a0926823.pdf |
| work_keys_str_mv | AT farzadshaveisi independencenumberingraphsanditsupperbounds |