New bounds on the independence number of connected graphs

DOI10.1142/S1793830918500696zbMath1400.05174OpenAlexW2889346524MaRDI QIDQ4554556

Elahe Sharifi, Nader Jafari Rad

Publication date: 14 November 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500696

zbMATH Keywords

independencetransversalmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new lower bound on the independence number of a graph and applications
• An improved lower bound on the independence number of a graph
• A lower bound on independence in terms of degrees
• Lower bounds on the independence number of certain graphs of odd girth at least seven
• Independence in connected graphs
• Independence in graphs with maximum degree four
• The independence number in graphs of maximum degree three
• Independence, clique size and maximum degree
• Lower bounds on the independence number in terms of the degrees
• On the independent domination number of regular graphs
• Independent domination in graphs: A survey and recent results
• A new lower bound on the independence number of graphs
• Independence, odd girth, and average degree
• Some Ramsey-Type Numbers and the Independence Ratio
• The potential of greed for independence
• New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
• Sharp bounds on the order, size, and stability number of graphs
• On the theory of graphs
• A new proof of the independence ratio of triangle-free cubic graphs
• On the independence number of a graph in terms of order and size