Results 1 - 10 of 13,817

Table 3. Algebraic connectivity of connected graphs on six vertices

in Ser. Mat. 4 �1993�, 49�67. TABLES OF GRAPH SPECTRA
by unknown authors
"... In PAGE 4: ... Paper n5b55n5d provides pictures of the 509 cubic graphs on fourteen vertices and some non-spectral data. Table3 in n5b24n5d, based on n5b5n5d, contains connected cubic graphs with up to 12 vertices. The pictures, spectrum and coen0ecients of the characteristic polynomials are included.... In PAGE 9: ... Table 2 contains algebraic connectivities for graphs in Table 1. Table3 refers to the table of 112 connected graphs on six vertices from n5b29n5d which is described in Section 1. Using identin0ccation numbers of graphs from n5b29n5d we give algebraic connectivities of the 112 connected graphs.... ..."

Table 3: Relationship of the Haar Spectrum and Output Probabilities

in Boolean Function Representation and Spectral Characterization Using AND/OR Graphs
by A. Zuzek, R. Drechsler, M. A. Thornton 2000
"... In PAGE 9: ... The following table contains symbols for each of the Haar coe cients, Hi, values that indicate the size of the constituent function range, i and n, and probability expressions that evaluate whether the function to be transformed and the constituent function simultaneously evaluate to logic-0 (denoted as pm0), or evaluate to logic-1 (denoted as pm1). Using the notation introduced in Table3 , we can write an algebraic equation to compute the value of the kth Haar spectral coe cient in terms of the output probabilities used to compute pm0 and pm1. Hk = 2n?i[2(pm0 + pm1) ? 1] (13) 7 Probability Extraction from Graphs Techniques for the extraction of output probability values from generalized graphs are given here.... ..."
Cited by 1

Table 4: Matrix N for the NC-spectrum graph in Figure 4.

in H O
by Ting Chen, Ming-yang Kao, Matthew Tepel, John Rush, George M. Church
"... In PAGE 10: ... Let N(i; j) = 0 otherwise. Table4 shows the matrix N for the NC-spectrum graph in Figure 4. Algorithm Compute-N(G) 1.... ..."

Table 2: Matrix M for the NC-spectrum graph in Figure 4.

in H O
by Ting Chen, Ming-yang Kao, Matthew Tepel, John Rush, George M. Church
"... In PAGE 6: ... 2 [1; i] [ [1; j]. Denote the two paths L [ R as the LR paths for M(i; j) = 1. Let M(i; j) = 0 otherwise. Table2 shows the matrix M for the NC-spectrum graph in Figure 4. 6... ..."

Table 3: Matrix Q for the NC-spectrum graph in Figure 4.

in H O
by Ting Chen, Ming-yang Kao, Matthew Tepel, John Rush, George M. Church
"... In PAGE 9: ... If Q(i; j) gt; 0, Q(i; j) = maxL;Rfs(L) + s(R)g, the maximum score among all L and R pairs. Table3 shows the matrix Q for the NC-spectrum graph in Figure 4 using a scoring function s(e) = 1 for every edge e 2 G. Algorithm Compute-Q(G) 1.... ..."

Table 1: Comparison of algorithmic and algebraic graph replacement approaches

in Programmed Graph Replacement Systems
by Andy Schürr 1997
"... In PAGE 40: ... We will use this framework over here for reviewing a number of di erent context sensitive graph replacement approaches (cf. Table1 in Subsection 4.5).... In PAGE 62: ...way for the work presented here. Furthermore, thanks to the two anonymous referees of this chapter for their helpful comments on a previous version, to An- dre Speulmanns for producing a rst version of Table1 (comparison of graph replacement approaches), and to Alexander Bell for his excellent Framemaker to LATEX compiling job. References 1.... ..."
Cited by 31

Table 3.1: Theorems joining spectrum of Laplacian with graph structure

in Wojciech Czech
by Im. Stanis̷lawa Staszica, Informatyki I, Katedra Informatyki, Praca Magisterska, Kraków Czerwiec 2007

Table 1: THE ALGEBRA OF BINARY FLOWNOMIALS .

in Reaction and Control I. Mixing Additive and Multiplicative Network Algebras
by Gheorghe Stefanescu 1998
"... In PAGE 4: ... cation). In Table1 we use some particular cases of the rami cation and identi cation constants, namely ^0; ^2; _0; _2 denoted by ?; ^; gt;; _, respectively. In the standard version presented in [Ste94] there are three groups of algebraic equations (see Table 1): (A) a large group of algebraic equations for owgraphs modulo graph{isomorphism B1{B10, A1{A19, R1{R5 and F1{F5; (S) some critical algebraic equations S1{S4 for the data ow nodes for rami cation and identi cation; (Z) an axiom scheme ENZ, presented as a conditional equation.... In PAGE 5: ...Table1 are valid in the semantical models IRel(D). Suppose D is a set of value-vectors which represent the memory states of a computing device.... In PAGE 6: ... More details of the model(s) are presented in [BeS94, BrS96, BeS95]. Let us recall that not all the axioms in Table1 are valid in this model, but at least the BNA axioms hold. In the following we will use an extension of this setting to the many sorted case.... ..."
Cited by 9

Table 1. Algebraic speci cation frameworks

in This document in subdirectoryRS/97/48/ CoFI: The Common Framework Initiative for Algebraic Specification and Development
by Peter D. Mosses, Peter D. Mosses 909
"... In PAGE 3: ... 1 Background A large number of algebraic speci cation frameworks have been provided during the past 25 years of research, development, and applications in this area. Table1 lists the main frameworks, with a rough indication of their chronology. Some of them are ambitious, wide-spectrum frameworks, equipped with a full ? E-mail: pdmosses@brics.... ..."

Table 1. An algebraic specification of the object place.

in A Conceptual Model of Wayfinding Using Multiple Levels of Abstraction
by Sabine Timpf, Sabine Timpf Gary S. Volta, Andrew U. Frank, Max J. Egenhofer 1992
"... In PAGE 5: ...ig. 1. Highways, interchanges, and places shown at the Planning Level. A place at this level can be specified as demonstrated in Table1 . The object apos;s underlying figure is a vertex (which is a node in the graph model) and the vertex is assumed to be already specified.... ..."
Cited by 41
Results 1 - 10 of 13,817