Journal of Guangdong University of Technology ›› 2009, Vol. 26 ›› Issue (4): 18-21.

• Comprehensive Studies • Previous Articles     Next Articles

Number of Perfect Matchings of Claw-free Cubic Graphs without  K4-e as Its Induced Subgraphs

  

  1. Huali College,Guangdong University of Technology,Guangzhou 511325,China
  • Online:2009-12-01 Published:2009-12-01

HTML

PDF (PC)

2069

Abstract: Let G be a simple graph with vertex set V（G） and edge set E（G）.A graph G is said to be claw-free if G does not contain any induced subgraph isomorphic to K1,3.A cubic graph is a graph,each vertex of which has degree three.The perfect matching number of claw-free cubic graphs without K4-e as its induced subgraphs is characterized.

Key words: perfect matching； claw-free graphs； cubic graphs；

[1] Bondy J A,Murty U S R.Graph Theory with Applications. . 1976

[2] Lovasz L,Plummer M D.Matching Theory. . 1985

[3] Wang Chunxiang,Fei Pusheng.Independence number in claw-free graphs. Acta Mathematica . 2009

[4] Allan,R.B.,Laskar,R.On domination and independent domination numbers of a graph. Discrete Mathematics . 1978
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech