On (n, k)-extendable graphs and induced subgraphs

Details On (n, k)-extendable graphs and induced subgraphs On (n, k)-extendable graphs and induced subgraphs

2006-09-27

arxiv.org/abs/math/0609755v1

Mathematics

Combinatorics

8 pages

Scientific paper

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$ edges and every $k$-matching can be extended to a 1-factor, then $G$ is called an $(n, k)-extendable graph. In this paper we present several results about $(n, k)$-extendable graphs and its subgraphs. In particular, we proved that if $G - V(e)$ is $(n, k)$-extendable graph for each $e \in F$ (where $F$ is a fixed 1-factor in $G$), then $G$ is $(n, k)$-extendable graph.

Affiliated with

Also associated with

No associations

Rating

On (n, k)-extendable graphs and induced subgraphs 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 On (n, k)-extendable graphs and induced subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On (n, k)-extendable graphs and induced subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167824