Independence and Matching Numbers in Triangle Free Graphs

Abstract:

Let α(G), β(G) and n(G) be the independence number, the matching number and the order of a graph G, respectively, the independence number and the matching number are two more important parameters for a graph. In this paper, it is proved that there exist two optimal numerical relationships between them for the graphs which are K3free and the maximum degree is 5 at most.