Fan-type results for the existence of [ a, b ]-factors

Haruhide Matsuda

doi:10.1016/j.disc.2006.01.018

Fan-type results for the existence of [ a, b ]-factors

Haruhide Matsuda

Research output: Contribution to journal › Article › peer-review

35 Citations (Scopus)

Abstract

Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.

Original language	English
Pages (from-to)	688-693
Number of pages	6
Journal	Discrete Mathematics
Volume	306
Issue number	7
DOIs	https://doi.org/10.1016/j.disc.2006.01.018
Publication status	Published - 2006 Apr 28
Externally published	Yes

Keywords

Factor
Fan-type
Graph
Neighborhood union
[ a, b ]-factor

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2006.01.018

Cite this

@article{6166f5f1fcf84491a070161602eb6572,

title = "Fan-type results for the existence of [ a, b ]-factors",

abstract = "Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.",

keywords = "Factor, Fan-type, Graph, Neighborhood union, [ a, b ]-factor",

author = "Haruhide Matsuda",

year = "2006",

month = apr,

day = "28",

doi = "10.1016/j.disc.2006.01.018",

language = "English",

volume = "306",

pages = "688--693",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "7",

}

TY - JOUR

T1 - Fan-type results for the existence of [ a, b ]-factors

AU - Matsuda, Haruhide

PY - 2006/4/28

Y1 - 2006/4/28

N2 - Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.

AB - Let 1 ≤ a < b be integers and G a graph of order n sufficiently large for a and b. Then G has an [ a, b ]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an / ( a + b ). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [ a, b ]-factor.

KW - Factor

KW - Fan-type

KW - Graph

KW - Neighborhood union

KW - [ a, b ]-factor

UR - http://www.scopus.com/inward/record.url?scp=33645851025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645851025&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2006.01.018

DO - 10.1016/j.disc.2006.01.018

M3 - Article

AN - SCOPUS:33645851025

SN - 0012-365X

VL - 306

SP - 688

EP - 693

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 7

ER -

Fan-type results for the existence of [ a, b ]-factors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this