For an integer ρ such that 1≤ρ≤v∕3, define β(ρ,v) to be the maximum number of blocks in any partial Steiner triple system on v points which parallel class has size ρ. We obtain lower bounds by giving explicit constructions, and upper result from counting arguments. show β(ρ,v)∈Θ(v) if is a constant, β(ρ,v)∈Θ(v2) ρ=v∕c, where c constant. When our differ constant depends Finally, we apply results...

objective: whereas social media or networks like citation databases can be applied to measure documentarticle usage, aim of the research is to investigate the social media or networks as one of the scholars' evaluation tools. method: the altmetric method_ measures based on social media or network_ was used for the survey. citations data was collected via search the names of scientific boar...

Abstract The contributions for the kaon pair from intermediate states and \rho(1700)^+ in decays B^+ \to \bar{D}^0 K^+ \bar{K}^0 , B^0 D^- B_s^0 D_s^-K^+ are analyzed within perturbative QCD factorization approach. decay amplitudes all concerned this work dominated by factorizable Feynman diagrams with emission of pair, charged ρ mesons should be great importance KK c...

In our 1988 edition, we replaced the ρ(1600) entry with two new ones, the ρ(1450) and the ρ(1700), because there was emerging evidence that the 1600-MeV region actually contains two ρ-like resonances. Erkal [1] had pointed out this possibility with a theoretical analysis on the consistency of 2π and 4π electromagnetic form factors and the ππ scattering length. Donnachie [2], with a full analysi...

In this paper, new concepts of monotonicity, namely (Φ, ρ)-monotonicity, (Φ, ρ)-pseudo-monotonicity and (Φ, ρ)-quasi-monotonicityare introduced for functions defined in Banach spaces. Series of necessary conditions are also given that relate (Φ, ρ)-invexity and generalized (Φ, ρ)-invexity of the function with (Φ, ρ)monotonicity and generalized (Φ, ρ)-monotonicity of its gradient.

For an arbitrary invariant ρ(G) of a graph G, the ρ−vertex stability number vsρ(G) is minimum vertices G whose removal results in H⊆G with ρ(H)≠ρ(G) or E(H)=∅. In this paper, first we give some general lower and upper bounds for ρ-vertex number, then study edge chromatic vertex graphs, vsχ′(G), where χ′=χ′(G) (chromatic index) G. We prove parameter determine vsχ′(G) specific classes graphs.