Minimum degree, independence number and pseudo [2,b]-factors in graphs

Details Minimum degree, independence number and pseudo [2,b]-factors in graphs Minimum degree, independence number and pseudo [2,b]-factors in graphs

2011-11-16

arxiv.org/abs/1111.3879v3

Computer Science

Discrete Mathematics

Scientific paper

A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each
component C on at least three vertices is a [2,b]-graph. The main contibution
of this paper, is to give an upper bound to the number of components that are
edges or vertices in a pseudo [2,b]-factor of a graph G. This bound is sharp.

Affiliated with

Also associated with

No associations

Rating

Minimum degree, independence number and pseudo [2,b]-factors in graphs 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 Minimum degree, independence number and pseudo [2,b]-factors in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum degree, independence number and pseudo [2,b]-factors in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-68925