Independence and Matching Numbers in Triangle Free Graphs

doi:10.11908/j.issn.0253-374x.2017.01.018

Home > Archive>Volume 45, Issue 01, 2017 >124-126. DOI:10.11908/j.issn.0253-374x.2017.01.018

Independence and Matching Numbers in Triangle Free Graphs
DOI:
                        10.11908/j.issn.0253-374x.2017.01.018
                    
CSTR:
                        [cstr]
                    
Author:
                        CHEN MingCHEN Ming
School of Mathematical Sciences, Tongji University, Shanghai 200092, China; College of Mathematics Physics and Information Engineering, Jiaxing University, Jiaxing 314000, China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site
LI YushengLI Yusheng
School of Mathematical Sciences, Tongji University, Shanghai 200092, China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site

                    
Affiliation:
Clc Number:O157.5
Fund Project:

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

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.

Key words:independence number; matching number; triangle; maximum degree

Get Citation

CHEN Ming, LI Yusheng. Independence and Matching Numbers in Triangle Free Graphs[J].同济大学学报(自然科学版),2017,45(01):124~126

Copy

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:March 29,2016
Revised:October 22,2016
Adopted:August 23,2016
Online: February 10,2017
Published:

Get Citation

Share

Article Metrics

History

Article QR Code