on expander graphs and hypergraphs

... OPEN DATABASE CONNECTIVITY  (ODBC) (CONTINUED)  ODBC defines  Standardized representation of data types  A library of ODBC functions  Standard methods of connecting to and logging on to a  DBMS 24 WEB APPLICATION COMPONENTS  Static Web pages  Created using HTML  Dynamic Web pages  Need special components  <form> tags  Common Gateway Interface (CGI)  Active Server Pages (ASP)...

Ngày tải lên: 17/09/2012, 10:44

Ngày tải lên: 21/09/2012, 11:00

... Science, Natural Sciences and Technology 24 (2008) 103-109 103 Conflicting chip firing games on graphs and on trees Tra An Pham 1 , Thi Ha Duong Phan 1,2,* , Thi Thu Huong Tran 1 1 Institute ... Natural Sciences and Technology 24 (2008) 103-109 105 2. The general model conflicting chip firing games In this section after giving the definition of the model Co...

Ngày tải lên: 12/02/2014, 17:20

... Corporation EURASIP Journal on Advances in Signal Processing Volume 2007, Article ID 41348, 11 pages doi:10.1155/2007/41348 Research Article Positioning Based on Factor Graphs Christian Mensing and Simon ... uplink and downlink mea- surements and are independent of the underlying wireless cellular network. 3. POSITIONING BASED ON FACTOR GRAPHS Historica...

Ngày tải lên: 22/06/2014, 20:20

... to investigate the in¯uence of expander and temperature on the cycle life of negative plates for EV battery applications. The structure of the active material of the negative plate consists of: (a) skeleton ... Degradation of the structure of the negative plates The second aim of this work was to investigate the in¯uence of expanders o...

Ngày tải lên: 05/07/2014, 21:20

... type of Shcherbina on the relation between pluriporlarity of graphs and holomorphicity of complex-valued functions defined on a domain in C n . In particular we establish the relation between the ... of graphs and holomorphicity of complex-valued functions. In particular, we investigate the relation between the pluripolarity of graphs and th...

Ngày tải lên: 06/08/2014, 05:20

... A Note on Sparse Random Graphs and Cover Graphs ∗ Tom Bohman † Alan Frieze ‡ Mikl´os Ruszinko Đ Lubos Thoma ả Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, ... a constant κ<2/3, then it outputs a cover graph whp. Note that the output graph will have whp girth equal to 4. On a related note we point to [8] which surveys constructions of no...

Ngày tải lên: 07/08/2014, 06:20

... harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on multi- variate ... this section, we deal with an abstract graph G satisfying certain conditions listed below. In the next sections, concrete examples of G will be considered. Our assumptions...

Ngày tải lên: 07/08/2014, 06:20

... operations that preserve well-coveredness under certain conditions may be found in [8], in- cluding the corona, the conjunction, the disjunction, and the Cartesian product of graphs. The case of the ... well-coveredness preserving operations. 2.1 Disjoint Union and the Join Let G 1 and G 2 be well-covered graphs. Then the disjoint union G 1  G 2 is also well- covere...

Ngày tải lên: 07/08/2014, 08:20

... same family of maximum cocliques of X and hence there exists an automorphism of Z mapping X to Y . Proof. The statement of the lemma gives sufficient indication of the proof. We note that the lemma ... The subgraph of order 80 induced by four of these subgraphs W i is identified as the second orbit of the stabiliser of the remaining one of these graphs in...

Ngày tải lên: 07/08/2014, 08:22

... (A(K)), and h. The object ensured by it must be equal to K and thus K  L. ✷ the electronic journal of combinatorics 15 (2008), #R75 5 On growth rates of permutations, set partitions, ordered graphs ... case of one-element set we write x < B instead of {x} < B. For a set X and k ∈ N we write  X k  for the set of all k-element subsets of X. Acknow...

Ngày tải lên: 07/08/2014, 21:20

... the diameters and perfectness of the graphs G n . the electronic journal of combinatorics 17 (2010), #R69 4 On restricted unitary Cayley graphs and symplectic transformations modulo n Niel de ... on a restricted variant of unitary Cayley graphs modulo n, an d implications for a decomposition of elements of symplectic operators over the integers modulo n. We...

Ngày tải lên: 08/08/2014, 12:22

... in the graph a t the time. To analyse the effect of prioritisation, we consider the effect of an operation Op on a set V i as the simultaneous destruction of some vertices of V i (by deleting them ... duality theorem of linear programming then gives us a simple way to check the claimed upper bound on the solution given by the primal LP. One of the themes of...

Ngày tải lên: 08/08/2014, 12:23

... Douglas and Wang in [1] has also been t ested on classes of strongly regular graphs and of regular g raphs, where all non-isomorphic graphs were distinguished. Finding a pair of non-isomorphic strongly ... arbitrary graphs; in fact, he shows that k- boson quantum walks do not distinguish arbitrary graphs. However, the question of whether or not the procedure distinguishes al...

Ngày tải lên: 08/08/2014, 14:23

Ngày tải lên: 13/11/2014, 11:16