Generalization of matching extensions in graphs (II)

Details Generalization of matching extensions in graphs (II) Generalization of matching extensions in graphs (II)

2006-09-27

arxiv.org/abs/math/0609756v1

Mathematics

Combinatorics

12 pages

Scientific paper

Proposed as a general framework, Liu and Yu(Discrete Math. 231 (2001) 311-320) introduced $(n,k,d)$-graphs to unify the concepts of deficiency of matchings, $n$-factor-criticality and $k$-extendability. Let $G$ be a graph and let $n,k$ and $d$ be non-negative integers such that $n+2k+d\leq |V(G)|-2$ and $|V(G)|-n-d$ is even. If when deleting any $n$ vertices from $G$, the remaining subgraph $H$ of $G$ contains a $k$-matching and each such $k$- matching can be extended to a defect-$d$ matching in $H$, then $G$ is called an $(n,k,d)$-graph. In \cite{Liu}, the recursive relations for distinct parameters $n, k$ and $d$ were presented and the impact of adding or deleting an edge also was discussed for the case $d = 0$. In this paper, we continue the study begun in \cite{Liu} and obtain new recursive results for $(n,k,d)$-graphs in the general case $d \geq0$.

Affiliated with

Also associated with

No associations

Rating

Generalization of matching extensions in graphs (II) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalization of matching extensions in graphs (II), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalization of matching extensions in graphs (II) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167829