نتایج جستجو برای: ecker number

تعداد نتایج: 1168450  

Journal: :Journal of Physics B 2022

Abstract We calculate the cross-section of ionization by free-electron impacts in high or moderate density plasmas. show that so-called potential depression (IPD) strongly affects magnitude high-density domain. use well-known IPD formulas Stewart–Pyatt and Ecker–Kröll. A more recent approach based on classical molecular dynamics simulation is also investigated. The latter provides an alternativ...

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :نشریه شهرسازی و معماری 0

0

Journal: :نشریه شهرسازی و معماری 0

0

2016
M. MEYER

Fighting corruption is a vital aspect of good governance. When assessing government performance voters should thus withdraw electoral support from government parties that turn a blind eye to or even engage in corrupt practices. Whereas most accounts of performance-based voting focus on economic outcomes, we analyse whether and to what extent voters punish incumbents for high levels of corruptio...

Journal: :international journal of group theory 2016
jean b. nganou

a positive integer $n$ is called a clt number if every group of order $n$ satisfies the converse of lagrange's theorem. in this note, we find all clt and supersolvable numbers up to $1000$. we also formulate some questions about the distribution of these numbers.

Journal: :journal of algorithms and computation 0
alex f. collins rochester institute of technology, school of mathematical sciences, rochester, ny 14623 alexander w. n. riasanovsky university of pennsylvania, department of mathematics, philadelphia, pa 19104, usa john c. wallace trinity college, department of mathematics, hartford, ct 06106, usa stanis law p. radziszowski rochester institute of technology, department of computer science, rochester, ny 14623

the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

Journal: :transactions on combinatorics 2012
b basavanagoud sunilkumar m hosamani

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید