审美家
发表于 2025-3-21 18:49:25
书目名称Combinatorial Mathematics VII影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0229932<br><br> <br><br>书目名称Combinatorial Mathematics VII读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0229932<br><br> <br><br>
tic-douloureux
发表于 2025-3-21 22:39:03
https://doi.org/10.1007/978-3-642-69659-6se numbers as n → ∞ is determined. Similar results are obtained for the mean and variance of the number of points in a phylogenetic tree with n labels. The effect of requiring that each nonempty label be a singleton is also studied.
小卒
发表于 2025-3-22 02:08:20
W. Dement,W. Seidel,M. Carskadonthere are only two vertex degrees, and the vertices of each degree induce a regular subgraph of G. The eigenvalues of each of these subgraphs determine the eigenvalues of the other. We are able to construct non-trivial NR-regular graphs with 4, 8, 28 and 32 vertices, and conjecture that there are infinitely many more.
我要沮丧
发表于 2025-3-22 07:13:04
http://reply.papertrans.cn/23/2300/229932/229932_4.png
袭击
发表于 2025-3-22 11:50:27
https://doi.org/10.1007/978-3-642-69659-6rbitrary parameters 0<r<1 and 0<ε<1, the algorithm ensures that, with probability r, its answer will be within a factor of ε of the true value of the permanent. Furthermore, the running time of the algorithm degrades by no worse than a polynomial as ε is decreased or r is increased.
Infiltrate
发表于 2025-3-22 14:20:20
http://reply.papertrans.cn/23/2300/229932/229932_6.png
Infiltrate
发表于 2025-3-22 20:13:01
Degree sequences uniquely realisable by hypergraphs,d let F(s.) be the corresponding set for s.-hypergraphs. Hakimi determined F(2), and F(s) can be derived from a result of Koren. Here we determine F(2.) and show that the "graph of 2.-realisations" of any sequence is connected.
Vasodilation
发表于 2025-3-23 00:49:20
An approximation algorithm for computing the permanent,rbitrary parameters 0<r<1 and 0<ε<1, the algorithm ensures that, with probability r, its answer will be within a factor of ε of the true value of the permanent. Furthermore, the running time of the algorithm degrades by no worse than a polynomial as ε is decreased or r is increased.
WAX
发表于 2025-3-23 03:21:32
The incidence algebra of a group reduced partially ordered set,rbit B if there exist elements a ε A and b ε B with a⩽b. We show that . (P(G)), the incidence algebra of P(G), is the homomorphic image of a subalgebra of .(P) via a Polya-type homomorphism. We compute a natural inverse image for each function of .(P(G)) and in particular for the Möbius function of P(G).
不能和解
发表于 2025-3-23 05:31:35
Pseudographic realizations of an infinitary degree sequence, the components of such graphs of realizations have already been obtained. We add to these results here and, in particular, determine all cases in which the graph has a component which is a path, and all cases in which it has an endvertex.