N. Biggs. Algebraic Graph Theory, Cambridge Uni- versity press, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Science and Engineering of Large Scale.. - Barrett, Eubank.. (Correct)
....a simple inverse threshold function. In either case, the message passing mechanism may be explicit channels or action symbols. 4 Preliminaries We assume the reader is familiar with basic concepts in computational complexity, algorithms, algebraic graph theory and dynamical systems, otherwise see [1, 26, 30, 38, 79, 98, 89, 100] A Sequential Dynamical System (SDS) over a given domain I of state values is a triple (Y, 9: whose components are as follows: 1. Y(V,E) is a finite undirected graph without multi edges or self loops. G is referred to as the underlying graph of . We use n to denote IVI and ra to denote ....
N. Biggs. Algebraic Graph Theory, Cambridge Uni- versity press, 1993.
A Primer of Simple Theories - Grossberg, Iovino, Lessman (2001) (Correct)
....TheoremA.2isan improvementofTheorem1.13. W e prove below that (jT j) 2 jT j ) Furthermore,when T iscountableorjTjisa singular stronglimitofcountablecoflnality,then (jTj) jTj (TheoremVII5.5(5) of[Sha] The followingtheoremiswell known. e.g.seeTheorem11.5. 1inWilfrid Hodges sbook[Ho]. Theorem A.3. LetP be a unarypredicateand a binarypredicatein L(T)suchthat T isa linearorderon P : SupposeM 2 EC (T; withP M = fa i :i (2 jT j ) g issuchthat M j= a i a j ifandonlyif i j (2 jT j ) Then there existsN 2 EC (T; suchthatP N isnotwell ordered by N . ....
WilfriedHodges.Mo deltheory.Cam bridgeUniversity Press,1993772pages.
A Primer of Simple Theories - Grossberg, Iovino, Lessman (2001) (Correct)
....TheoremA.2isan improvementofTheorem1.13. W e prove below that (jT j) 2 jT j ) Furthermore,when T iscountableorjTjisa singular stronglimitofcountablecoflnality,then (jTj) jTj (TheoremVII5.5(5) of[Sha] The followingtheoremiswell known. e.g.seeTheorem11.5. 1inWilfried Hodges sbook[Ho]. Theorem A.3. LetP be a unarypredicateand a binarypredicatein L(T)suchthat T isa linearorderon P : SupposeM 2 EC (T; withP M = fa i :i (2 jT j ) g issuchthat M j= a i a j ifandonlyif i j (2 jT j ) Then there existsN 2 EC (T; suchthatP N isnotwell ordered by N ....
WilfriedHodges.Mo deltheory.Cam bridgeUniversity Press,1993772pages.
Algebraic Combinatorics in Bayreuth - Kerber (1995) (Correct)
....and in the field of Algebraic Combinatorics, here is a list of discrete structures that we met and which we were able to construct up to a certain extent: ffl Graphs and multigraphs. Here is a multigraph: s s s s Obviously a multigraph can be considered as an interaction model (see e.g. [2]) where the edges indicate the strength of the interaction between the various objects indicated by the vertices. In many cases it is therefore of interest to construct the multigraphs with given number of vertices and with given vertex degrees. The next item shows a case when a construction of ....
N.L.Biggs. Interaction Models. Cambridge University Press, 1977.
Statistical Mechanics, Three-Dimensionality and NP-completeness - .. - Istrail (Correct)
.... was solved using determinats via Pfaffians by Kasteleyn 1964 [ and Fisher [8] A more comprehensive account of the developments concerning statistical mechanics research of the Ising model can be obtained from: 6] 5] 8] 35] 20] 37] 30] 17] 29] 16] 4] 9] 27] 10] [3], 14] 28] 1.2.1 Ising Models and Computational Complexity NP completeness was used as a rigurous method to classify the computational complexity of problems in statistical physics, see e.g. 36; 37] Powerful intractability results, previously obtained, in the area of Ising models, closely ....
N. L. Biggs. Interaction Models. Cambridge University Press, 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC