Paper Titles

Interaction and Mediation Patterns for Service Composition
p.3988

Intuitionistic Fuzzy Sets with Double Parameters and its Application to Automatic Control System
p.3993

Investigation on Local Optical Parameters of Liver Tumors in Laser-Induced Thermotherapy
p.3998

IT Performance Key Factors Extraction Based on PCA Selective Ensemble
p.4003

K − Bipartite Matching Extendability of Special Graphs
p.4008

Key Technologies of Network Collaborative Modeling Based on B/S Structure
p.4013

Key Technologies Research of an Interactive Realistic Graphics Visualization System Based on Visual C++ and OpenGL
p.4018

Master-Slave Parallel Genetic Algorithm Based on MapReduce Using Cloud Computing
p.4023

Measurement of Hysteresis Loop by Using Pulsed Magnetic Field in LabView Environment
p.4028

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 121-126K − Bipartite Matching Extendability of Special...

K − Bipartite Matching Extendability of Special Graphs

Article Preview

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.

You might also be interested in these eBooks

Frontiers of Manufacturing and Design Science II

Info:

Periodical:

Applied Mechanics and Materials (Volumes 121-126)

Pages:

4008-4012

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.121-126.4008

Citation:

Cite this paper

Online since:

October 2011

Authors:

Zhi Hao Hui, Jin Wei Yang, Biao Zhao

Keywords:

Bipartite Matching, Bipartite Matching Extendable, k - Bipartite Matching Extendable

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Bondy J A, Murty U S R.: Graph Theory with Applications. London: Macmillan Press Ltd (1976).

[2] Lováasz L, Plummer M D: Matching Theory. North Holland B V: Elsevier Science Publishers, (1985).

[3] Aldred R E L, Holton D A, Lou D J, etal.: Discrete Mathematics Vol. 287(2004), pp.135-139.

[4] Anunchuen N, Caccetta L: Australasian Journal of Combinatorics Vol. 9(1994), pp.153-168.

[5] Plummer M D: Discrete Mathematics Vol. 31(1980), pp.201-210.

[6] Plummer M D: Discrete Mathematics, Vol. 127(1994), pp.277-292.

[7] Qinglin Yu: Journal of Graph Theory Vol. 16(1992), pp.349-353.

[8] Jinjiang Yuan: Journal of Graph Theory Vol. 28(1998), pp.203-213.

[9] Xiumei Wang, Zhenkun Zhang , Yixun Lin: Discrete Mathematics Vol. 308(2008), pp.5334-5341.

[10] Quan Huan, Zhang X D: Henan Science Vol. 26(2008), pp.15-18, in Chinese.

[11] Xiumei Wang, Zhenkun Zhang , Yixun Lin: Ars Combinatoria Vol. 90(2009), pp.295-305.

[12] Zhihao Hui, Biao Zhao: Journal of Zhejiang University(Science Edition) Vol. 36(2009), pp.493-496, in Chinese.

[13] Tutte W T: Journal of the London Mathematical Society Vol. 22(1947), pp.107-111.