Binding numbers and f-factors of graphs

Author: nlhh

August undefined, 2024

WebDec 31, 2024 · Let g and f be nonnegative integer-valued functions defined on V (G) such that a<= g (x)=1+ ( (b-2)/ (a+1)), then G has a (g,f)-factor. Downloads PDF Additional Files Cover letter Published 2024-12-31 Issue Vol. 13 No. 2 (2024) Section Articles License WebBINDING NUMBER, MINIMUM DEGREE AND (g;f)-FACTORS OF GRAPHS TAKAMASA YASHIMA Abstract. Let aand bbe integers with 2 a

Binding numbers and f-factors of graphs - ScienceDirect

WebNov 1, 2010 · In this paper, we obtain some sufficient conditions based on binding number for a graph to have a connected factor with degree restrictions. Let α and k be positive … WebDec 31, 2024 · Let g and f be nonnegative integer-valued functions defined on V (G) such that a<= g (x) can buckwheat flour go bad

Cells Free Full-Text Epigallocatechine-3-gallate Inhibits the ...

WebApr 9, 2024 · Zhou, S. Binding numbers and restricted fractional ( g, f )-factors in graphs. Discrete Applied Mathematics, 305: 350–356 (2024) Article MathSciNet Google Scholar Zhou, S. Remarks on orthogonal factorizations of digraphs. International Journal of Computer Mathematics, 91: 2109–2117 (2014) Article MathSciNet Google Scholar http://www.iaeng.org/IJAM/issues_v49/issue_2/IJAM_49_2_02.pdf WebA fractional (g;f)-factor is a function h that assigns to each edge of a graph Ga number in [0,1] so that for each vertex xwe have g(x) dh G (x) f(x), where dh G (x) = P e2E(x) h(e) is called the fractional degree Manuscript received … fishing lure rattle trap

$Binding numbers and restricted fractional ( g , f )-factors in graphs ...$

DisP-seq reveals the genome-wide functional organization of DNA ...

WebMar 1, 1992 · Let G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, and f: V(G) → {a, a + 1, …, b} be a function such that Σ(f(x); x ∈ V(G)) ≡ 0 (mod 2).We prove the following two results: (i) If the binding number of G is greater than (a + … WebA k-factor of a graph is a spanning k-regular subgraph, and a k-factorization partitions the edges of the graph into disjoint k-factors. A graph G is said to be k-factorable if it admits a k-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a k-regular graph is an edge coloring with k colors. A 2-factor is ... can buckwheat flour replace white flourWebS. Zhou, Binding numbers and restricted fractional (g, f)-factors in graphs. Discrete Appl. Math. 305 (2024) 350–356. [CrossRef] [MathSciNet] [Google Scholar] S. Zhou, Path factors and neighborhoods of independent sets in graphs. can buckyballs conduct electricity

"WebJan 31, 2024 · Abstract Let G be a graph and a, b and k be nonnegative integers with 1 ≤ a ≤ b. A graph G is defined as all fractional (a, b, k)-critical if after deleting any k vertices of G, the remaining graph has all fractional [a, b]-factors. In this paper, we prove that if , then G is all fractional (a, b, k) -critical. If k = 0, we improve the result given in [Filomat 29 (2015) … " - Binding numbers and f-factors of graphs

Binding numbers and f-factors of graphs

Transcriptomic Analysis and Specific Expression of Transcription Factor …

WebApr 7, 2024 · When looking at network graphs showing HLA alleles and their neighbors, those with 2W-3W-5W-9M (blue) and 2W-3W-9M (green) patterns are scattered among different clusters with some alleles even acting as the center node (indicating nonzero amount of training data and, thus, no need to estimate binding based on similar alleles; … WebS. Zhou and Z. Sun, Binding number conditions for P ≥2-factor and P ≥3-factor uniform graphs. Discrete Math. 343 (2024) 111715. [Google Scholar] S. Zhou and Z. Sun, A neighborhood condition for graphs to have restricted fractional (g, f)-factors. Contrib. Discrete Math. 16 (2024) 138–149

Did you know?

WebBinding number, minimum degree and (g, f)-factors of graphs Takamasa Yashima Mathematics Contributions Discret. Math. 2024 Let a and b be integers with 2 = (a+b-1)^2/(a+1) and the minimum degree \delta(G) =1+((b-2)/(a+1)), then G has a (g,f)-factor. View 1 excerpt Save Alert Binding Numbers and Connected Factors Y. Nam … WebApr 17, 2009 · An [a, b]-factor of graph G is defined as a spanning subgraph F of G such that a ≤ d F (x) ≤ b for each x ϵ V (F). Then a graph G is called an ( a, b, k )-critical …

WebJan 1, 1992 · This chapter discusses the binding number of graphs and presents a lower bound, at present the only one known, involving the connectivity number and the Hallian index. The order of a graph G is V ( G) and its size E ( G) . WebAug 31, 2024 · In this article, we verify that (i) a ( 2 m + 1) -connected graph G is an ( F, m) -factor deleted graph if its binding number b i n d ( G) ≥ 4 m + 2 2 m + 3; (ii) an ( n + 2) -connected graph G is an ( F, n) -factor critical graph if its binding number b i n d ( G) ≥ 2 + n 3; (iii) a ( 2 m + 1) -connected graph G is an ( H, m) -factor deleted …

WebIn this paper, we also consider the binding number condition for an ( n + 2) -connected graph to be ( P ≥ 3, n) -factor critical deleted, which improves the result in the above … Webbinding number of G is greater than (a+ b - I)(n - l)/(an - (a+ b)+ 3) and n 2 (a + b)2/a, then G has an f-factor; (ii) If the minimum degree of G is greater than (bn - 2)/(a + b), and n > …

WebMay 25, 2016 · Apobec-1 complementation factor (A1CF) is a heterogeneous nuclear ribonuceloprotein (hnRNP) and mediates apolipoprotein-B mRNA editing. A1CF can promote the regeneration of the liver by post-transcriptionally stabilizing Interleukin-6 (IL-6) mRNA. It also contains two transcriptional variants-A1CF64 and A1CF65, distinguished …

WebApr 14, 2024 · We show SESN2 competes with insulin like growth factor 2 mRNA binding protein 3 (IGF2BP3) for binding with the 3′-UTR region of HK2 mRNA. ... Total cell … can buckwheat cause gashttp://gorogoro.cis.ibaraki.ac.jp/web/papers/Kano1992-b.pdf fishing lure reviewsWebAug 31, 2024 · Component factors and binding number conditions in graphs. 1. School of Science, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212100, … fishing lure ringsWebMar 1, 1992 · Mixed conditions on the binding number and the minimum degree of a graph G that guarantee the existence of a k-factor in G are studied and it is proved that agraph … fishing lure rattleWebJan 1, 2024 · Request PDF Binding number, minimum degree and (G, f)-factors of graphs Let a and b be integers with 2 ≤ a < b, and let G be a graph of order n with n ≥ … fishing lures ebayWebXu [20] established some relationships between binding numbers and graph factors. Some other results on graph factors can be found in [21–26]. The purpose of this paper is to weaken the binding number conditions in Theorems 5–7 … fishing lure retriever reviewsWebMay 20, 2024 · Epigallocatechin-3-gallate (EGCG) has widespread effects on adipocyte development. However, the molecular mechanisms of EGCG are not fully understood. We investigate the adipogenic differentiation of human-derived mesenchymal stem cells, including lipid deposition and changes in the expression and phosphorylation of key … can buckwheat groats be eaten raw