Binding numbers and f-factors of graphs

Author: bhvc

August undefined, 2024

WebJan 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 ≥ … Webfollowing two results: (i) If the binding number of G is greater than (a+b 1)(n 1)=(an (a+b)+3) and n (a+b)2=a, then G has an f-factor; (ii) if the minimum degree of G is …

Binding number and Hamiltonian (g, f) -factors in graphs - Springer

Webof r-factors in graphs; Kano and Tokushige [24] demonstrated a result on the relationship between the binding number and the existence of f-factors in graphs; Zhou and Sun [25,26] derived some binding number conditions for graphs to possess [1,2]-factors with given properties; Chen [27] put forward a binding number condition for WebAug 31, 2024 · Component factors and binding number conditions in graphs. 1. School of Science, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212100, … greensburg civil war roundtable

(PDF) Independence Number, Connectivity and All Fractional (a, b, …

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 … 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 + … 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 … fmf fact sheet

Frontiers Computational pharmacology and computational …

Binding number, minimum degree and (g,f)-factors of …

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 … 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 > … greensburg collision centerWebBINDING NUMBER, MINIMUM DEGREE AND (g;f)-FACTORS OF GRAPHS TAKAMASA YASHIMA Abstract. Let aand bbe integers with 2 a fmf factory fatty

"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) . " - Binding numbers and f-factors of graphs

Binding numbers and f-factors of graphs

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR …

WebBinding Number and Connected ( g, f + 1)-Factors in Graphs Jiansheng Cai, Guizhen Liu & Jianfeng Hou Conference paper 1363 Accesses Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4489) Abstract Let G be a connected graph of order n and let a, b be two integers such that 2 ≤ a ≤ b. 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

Did you know?

WebApr 11, 2024 · A variety of inflammatory factors and tissue factors are the major inducers and drivers of renal inflammation and plays a major part in the network of pro-inflammatory molecules in the DN. In patients with DN, the PI3K-Akt pathway has been demonstrated to be an important signaling pathway (Chen et al., 2013). WebLet G be a connected graph of order n and let a,b be two integers such that 2 ≤ a ≤ b.Let g and f be two integer-valued functions defined on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for …

WebS. 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. WebMar 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 …

WebBINDING NUMBER, MINIMUM DEGREE AND (g;f)-FACTORS OF GRAPHS TAKAMASA YASHIMA Abstract. Let aand bbe integers with 2 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 ...

WebBackground: Dryopteris fragrans, which is densely covered with glandular trichomes, is considered to be one of the ferns with the most medicinal potential. The transcriptomes from selected tissues of D. fragrans were collected and analyzed for functional and comparative genomic studies. The aim of this study was to determine the transcriptomic …

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 … greensburg collision center 15601WebOct 14, 2011 · The binding number of G is defined by In this paper, it is proved that if then G is a fractional ( k, m) -deleted graph. Furthermore, it is shown that this result is best possible in some sense. Keywords graph fractional k-factor fractional (k,m)-deleted graph binding number minimum degree MSC classification greensburg collisionWebApr 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 … greensburg city policeWebDec 1, 2024 · We say that G admits property E ( m , n ) with respect to fractional ( g , f )-factor if for any two sets of independent edges M and N with M = m, N = n and M ∩ … fmf factoryWebXu [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 … fmf fatty gold seriesWebA MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS - Volume 86 Issue 2. Skip to main content Accessibility help We use cookies to distinguish you from other users and to provide you with a better experience on our websites. ... ‘ Binding numbers and connected factors ’, ... fmf fatty exhaustWebApr 13, 2024 · The molecular volume to van der Waals volume ratio was calculated as 147.06. The number of hydrogen bond acceptors (nHA; optimal: 0–12) is 4. ... The bioavailability is predicted to be greater than 20% and 30% (F 20% 0.004, F 30% 0.002). The oral bioavailability graph shown in Figure 1A is predicted with the SwissADMET … fmf factory 4.1