Binding numbers and f-factors of graphs
WebXu [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 … WebA 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 ’, ...
Binding numbers and f-factors of graphs
Did you know?
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 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 …
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 WebApr 14, 2024 · The amount of bound DNA was measured by comparing the concentration of DNA in the supernatant before and after binding, yielding a binding efficiency of …
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 … WebDec 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 ∩ …
WebApr 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 …
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 … citrine circle healingWebJan 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) … citrix enterprise downloadWebApr 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 … citric acid cross-linking of starch filmsWebOct 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 citrix receiver settingsWebBackground: 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 … citrix receiver \u0026 workspaceWebfollowing 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 … citrix workspace 2205.1WebApr 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 … citrix workspace 2008.1