Paper Title:
K − Bipartite Matching Extendability of Special Graphs
  Abstract

Let be a simple connected graph containing a perfect matching. For a positive integer , , is said to be bipartite matching extendable if every bipartite matching of with is included in a perfect matching of . In this paper, we show that bipartite matching extendability of some special graphs.

  Info
Periodical
Chapter
Chapter 7: Computer Application in Design and Manufacturing (1)
Edited by
Dongye Sun, Wen-Pei Sung and Ran Chen
Pages
4008-4012
DOI
10.4028/www.scientific.net/AMM.121-126.4008
Citation
Z. H. Hui, J. W. Yang, B. Zhao, "K − Bipartite Matching Extendability of Special Graphs", Applied Mechanics and Materials, Vols. 121-126, pp. 4008-4012, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Xiao Yi Li, Zhao Di Xu, Wan Xi Chou
Abstract:Basic idea of this paper is constructing the v order Steiner triple systems. A definition of the edge matrix is given, a method of...
1205
Authors: Luo Zhong Gong
Chapter 2: Material Science and Engineering
Abstract:Carbon nanotubes show remarkable mechanical properties. Experimental studies have shown that they belong to the stiffest and elastic known...
271
Authors: Yan Zhong Hu, Nan Jiang, Hua Dong Wang
Chapter 1: Material Engineering and its Application
Abstract:The main purpose of this paper is to study the non-planarity of a graph after the tensor product operation. Introduced the concept of...
136
Authors: Xiao Yi Li, Zhao Di Xu, Wan Xi Chou
Chapter 3: Applied Sciences and Engineering Researches
Abstract:This paper describes the basic concept of constructing Steiner triple system of order and gives the definition edge matrix of a complete...
3061