作者: Infiltrate 時(shí)間: 2025-3-22 20:13
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 時(shí)間: 2025-3-23 00:49
An approximation algorithm for computing the permanent,rbitrary parameters 0
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).
作者: 不能和解 時(shí)間: 2025-3-23 05:31
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.
作者: APO 時(shí)間: 2025-3-23 10:57
作者: 無(wú)辜 時(shí)間: 2025-3-23 15:43
Graphs with regular neighbourhoods,there 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.
作者: Cumulus 時(shí)間: 2025-3-23 20:33
作者: Sciatica 時(shí)間: 2025-3-24 00:23
Doubly and orthogonally resolvable quadruple systems,∩ γ′.|?1 for all i and j. This paper contains constructions of (2,3)(1,1)-doubly resolvable quadruple systems of orders v = 20,32,44, 68,80 and 104; a(2,3)-resolvable quadruple system of order 128; and some sets of mutually orthogonal resolutions of quadruple systems of all the above orders.
作者: 步履蹣跚 時(shí)間: 2025-3-24 03:04
Degree sequences uniquely realisable by hypergraphs,ices. Let F(s) be the set of all finite sequences of non-negative integers which have a unique realisation in the set of all s-uniform hypergraphs, and 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
作者: curriculum 時(shí)間: 2025-3-24 10:33
On generating spatial configurations with identical interpoint distance distributions,yet have identical interpoint distance distributions. In this paper we demonstrate a method for doing this with any set of points or figures and demonstrate the application of the finding to image processing studies.
作者: 和音 時(shí)間: 2025-3-24 11:08
作者: extrovert 時(shí)間: 2025-3-24 17:25
Determining the asymptotic number of phylogenetic trees,points have been labelled with disjoint subsets of the labelling set. Every point of degree less than three must have a nonempty label. Formulas are found for the exact numbers of phylogenetic trees with n labels, and numerical results are presented for selected n?40. The asymptotic behaviour of the
作者: 廢墟 時(shí)間: 2025-3-24 20:16
作者: 碳水化合物 時(shí)間: 2025-3-25 00:09
作者: 無(wú)可爭(zhēng)辯 時(shí)間: 2025-3-25 03:59
作者: Spartan 時(shí)間: 2025-3-25 09:54
Doubly and orthogonally resolvable quadruple systems,of X is contained in precisely λ blocks. A . of order v is a Steiner system S.(3,4,v). A triple (X,β,γ) is called an (s,μ)-. if for some s
Establishing the minimality of phylogenetic trees from protein sequences, note we consider some new techniques developed to enable researchers to analyse such trees on larger data sets. The basic principle involved is to split the problem into a number of smaller problems which can be more easily handled. Much of the work is described in graph theoretic terms, but no dee
作者: 仔細(xì)檢查 時(shí)間: 2025-3-25 19:36
Balanced ternary designs with block size three,ock. The condition . (mod 3) is shown to be both necessary and sufficient for the existence of a BTD on . elements with block size 3 and index 2 in which each element is repeated in exactly one block and each element occurs in a constant number of blocks.
作者: 缺陷 時(shí)間: 2025-3-25 23:11
https://doi.org/10.1007/BFb0088895Hypergraph; Kombinatorik; Mathematics; Ramsey theory; algorithms; graphs; combinatorics
作者: Encoding 時(shí)間: 2025-3-26 02:06
978-3-540-10254-0Springer-Verlag Berlin Heidelberg 1980
作者: mechanical 時(shí)間: 2025-3-26 06:14
Combinatorial Mathematics VII978-3-540-38376-5Series ISSN 0075-8434 Series E-ISSN 1617-9692
作者: chemoprevention 時(shí)間: 2025-3-26 09:30
作者: ELUC 時(shí)間: 2025-3-26 14:17
作者: 周年紀(jì)念日 時(shí)間: 2025-3-26 18:35
Sleep, Benzodiazepines and Performance note we consider some new techniques developed to enable researchers to analyse such trees on larger data sets. The basic principle involved is to split the problem into a number of smaller problems which can be more easily handled. Much of the work is described in graph theoretic terms, but no deep results of graph theory are called upon.
作者: farewell 時(shí)間: 2025-3-26 22:15
Amnesic Effects of Lormetazepamock. The condition . (mod 3) is shown to be both necessary and sufficient for the existence of a BTD on . elements with block size 3 and index 2 in which each element is repeated in exactly one block and each element occurs in a constant number of blocks.
作者: aphasia 時(shí)間: 2025-3-27 02:48
Amy S. Korwin,Melissa P. Knauertices. Let F(s) be the set of all finite sequences of non-negative integers which have a unique realisation in the set of all s-uniform hypergraphs, and 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
作者: 奇思怪想 時(shí)間: 2025-3-27 06:15
Melissa P. Knauert,Sairam Parthasarathyyet have identical interpoint distance distributions. In this paper we demonstrate a method for doing this with any set of points or figures and demonstrate the application of the finding to image processing studies.
作者: Euphonious 時(shí)間: 2025-3-27 11:10
F. Zorick,N. Kribbs,T. Roehrs,T. Rothme degree sequence are . if one can be obtained from the other by an elementary operation called switching. With this notion of adjacency we can regard distinct pseudographs with the same degree sequence as the vertices of a graph, called the . of that sequence. Some results concerning the nature of
作者: subacute 時(shí)間: 2025-3-27 14:04
作者: CORD 時(shí)間: 2025-3-27 19:29
作者: 貨物 時(shí)間: 2025-3-27 21:57
作者: 身體萌芽 時(shí)間: 2025-3-28 03:58
作者: 騷擾 時(shí)間: 2025-3-28 09:57
作者: 相互影響 時(shí)間: 2025-3-28 11:55
作者: Circumscribe 時(shí)間: 2025-3-28 16:36
Amnesic Effects of Lormetazepamock. The condition . (mod 3) is shown to be both necessary and sufficient for the existence of a BTD on . elements with block size 3 and index 2 in which each element is repeated in exactly one block and each element occurs in a constant number of blocks.
作者: 一窩小鳥(niǎo) 時(shí)間: 2025-3-28 21:20
Spina Bifida and Chiari MalformationsThis is an expository set of lectures with the purpose of surveying the results in the two-dimensional case of Ramsey’s Theorem. Some results on the Euclidean Ramsey numbers are also surveyed.
作者: 柔聲地說(shuō) 時(shí)間: 2025-3-29 02:26
Maria Cecilia Melendres,George T. CaponeA (v, k, 1)-BIBD D is said to be . if there exists a . array A such that each cell of A is either empty or contains a block of D, each variety of D is contained in one cell of each row and column of A and every block of D is in some cell of A. In this paper, we investigate automorphisms of such arrays.
作者: DECRY 時(shí)間: 2025-3-29 04:07
作者: 躺下殘殺 時(shí)間: 2025-3-29 10:31
作者: 阻撓 時(shí)間: 2025-3-29 13:39
作者: 喃喃而言 時(shí)間: 2025-3-29 17:17
作者: 容易懂得 時(shí)間: 2025-3-29 20:30
Sleep, Benzodiazepines and PerformanceThe following conjecture is introduced: a connected composite graph G × H with G and H on more than two points is uniquely determined by each of its two-point deleted subgraphs. A theorem is proved that supports the conjecture.
作者: 貪婪的人 時(shí)間: 2025-3-30 00:50
作者: 極為憤怒 時(shí)間: 2025-3-30 06:55
Introduction to Ramsey theory,This is an expository set of lectures with the purpose of surveying the results in the two-dimensional case of Ramsey’s Theorem. Some results on the Euclidean Ramsey numbers are also surveyed.
作者: ILEUM 時(shí)間: 2025-3-30 09:32
作者: Fierce 時(shí)間: 2025-3-30 15:53
作者: Essential 時(shí)間: 2025-3-30 19:53
作者: 自愛(ài) 時(shí)間: 2025-3-31 00:39
作者: 貝雷帽 時(shí)間: 2025-3-31 02:08
作者: preeclampsia 時(shí)間: 2025-3-31 06:24
A conjecture on two-point deleted subgraphs of cartesian products,The following conjecture is introduced: a connected composite graph G × H with G and H on more than two points is uniquely determined by each of its two-point deleted subgraphs. A theorem is proved that supports the conjecture.
作者: STELL 時(shí)間: 2025-3-31 12:21
作者: 存在主義 時(shí)間: 2025-3-31 15:03
On generating spatial configurations with identical interpoint distance distributions,yet have identical interpoint distance distributions. In this paper we demonstrate a method for doing this with any set of points or figures and demonstrate the application of the finding to image processing studies.
作者: 叢林 時(shí)間: 2025-3-31 18:00
Establishing the minimality of phylogenetic trees from protein sequences, note we consider some new techniques developed to enable researchers to analyse such trees on larger data sets. The basic principle involved is to split the problem into a number of smaller problems which can be more easily handled. Much of the work is described in graph theoretic terms, but no deep results of graph theory are called upon.
| 歡迎光臨 派博傳思國(guó)際中心 (http://pjsxioz.cn/) | Powered by Discuz! X3.5 |