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!
|