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: | Farzad Shaveisi |
---|---|
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!
|
Similar Items
-
Relations between the distinguishing number and some other graph parameters
by: Bahman Ahmadi, et al.
Published: (2024-11-01) -
Marcinkiewicz-type strong law of large numbers for double arrays of pairwise independent random variables
by: Dug Hun Hong, et al.
Published: (1999-01-01) -
THE STRUCTURE OF GRAPHS ON \(n\) VERTICES WITH THE DEGREE SUM OF ANY TWO NONADJACENT VERTICES EQUAL TO \(n-2\)
by: Do Nhu An
Published: (2021-10-01) -
Feature selection method for software defect number prediction based on maximum information coefficient
by: Guoqing LIU, et al.
Published: (2021-05-01) -
On the cooling number of the generalized Petersen graphs
by: Kai An Sim, et al.
Published: (2024-12-01)