A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph (Q2811824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph |
scientific article; zbMATH DE number 6592409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph |
scientific article; zbMATH DE number 6592409 |
Statements
10 June 2016
0 references
\([a
0 references
b]\)-factor
0 references
minimum degree condition
0 references
excluded subgraph
0 references
0.9595082
0 references
0.9551342
0 references
0.94668716
0 references
0.93872166
0 references
0.9106321
0 references
A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph (English)
0 references
For a graph \(G\) and two positive integers \(a\leq b\), a graph \(F\) is an \([a,b]\)-factor of \(G\) if \(F\) is a spanning subgraph of \(G\) with minimum degree \(\delta (F)\geq a\) and maximum degree \(\Delta (F)\leq b\). In this paper, it is proven that in a graph \(G\) of order \(n\) and minimum degree \(\delta (G)\geq a+2m\), if \(|N_G(x)\cup N_G(y)|\geq {{an}\over {a+b}}\) for any two non-adjacent vertices \(x\) and \(y\) in \(G\) such that \(N_G(x)\cap N_G(y)\not=\emptyset\), then \(G\) has an \([a,b]\)-factor that excludes any set of \(m\) edges in \(G\).
0 references
