Titlebook: Combinatorial Mathematics VII; Proceedings of the S Robert W. Robinson,George W. Southern,Walter D. Wa Conference proceedings 1980 Springer

審美家

書(shū)目名稱(chēng)Combinatorial Mathematics VII影響因子(影響力)




書(shū)目名稱(chēng)Combinatorial Mathematics VII影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Mathematics VII網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Combinatorial Mathematics VII網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Mathematics VII被引頻次




書(shū)目名稱(chēng)Combinatorial Mathematics VII被引頻次學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Mathematics VII年度引用




書(shū)目名稱(chēng)Combinatorial Mathematics VII年度引用學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Mathematics VII讀者反饋




書(shū)目名稱(chēng)Combinatorial Mathematics VII讀者反饋學(xué)科排名

tic-douloureux

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.

小卒

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.

我要沮喪

襲擊

https://doi.org/10.1007/978-3-642-69659-6rbitrary parameters 0

Infiltrate

Infiltrate

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

An approximation algorithm for computing the permanent,rbitrary parameters 0

WAX

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).

不能和解

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.