Back to Search
Start Over
Remarks on restricted fractional [formula omitted]-factors in graphs.
- Source :
-
Discrete Applied Mathematics . Sep2024, Vol. 354, p271-278. 8p. - Publication Year :
- 2024
-
Abstract
- Assume there exists a function h : E (G) → [ 0 , 1 ] such that g (x) ≤ ∑ e ∈ E (G) , x ∋ e h (e) ≤ f (x) for every vertex x of G. The spanning subgraph of G induced by the set of edges { e ∈ E (G) : h (e) > 0 } is called a fractional (g , f) -factor of G with indicator function h. Let M and N be two disjoint sets of independent edges of G satisfying | M | = m and | N | = n. We say that G possesses a fractional (g , f) -factor with the property E (m , n) if G contains a fractional (g , f) -factor with indicator function h such that h (e) = 1 for each e ∈ M and h (e) = 0 for each e ∈ N. In this article, we discuss stability number and minimum degree conditions for graphs to possess fractional (g , f) -factors with the property E (1 , n). Furthermore, we explain that the stability number and minimum degree conditions declared in the main result are sharp. [ABSTRACT FROM AUTHOR]
- Subjects :
- *INDEPENDENT sets
*SPANNING trees
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 354
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 177564769
- Full Text :
- https://doi.org/10.1016/j.dam.2022.07.020