... 05C80 Abstract We introduce a pair of natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold ... approach to random threshold graphs that is based on a recursive description of their structure (see Theorem 2.7) was presented in [11] whose goal was to use thr...
Ngày tải lên: 08/08/2014, 11:20
... 05C80 Abstract We introduce a pair of natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold ... combinatorics 16 (2009), #R1 30 31 Random Threshold Graphs Elizabeth Perez Reilly Edward R. Scheinerman Department of Applied Mathematics and Statistics...
Ngày tải lên: 08/08/2014, 01:20
Báo cáo toán học: "Random Cayley graphs are expanders: a simple proof of the Alon–Roichman theorem" potx
... Leonard Schulman. Improved expansion of random cayley graphs. 2004. [7] Jean-Pierre Serre. Linear Representations of Finite Groups. Springer-Verlag, 1977. the electronic journal of combinatorics ... is primarily for the purposes of setting down notation; we refer the reader to the more complete accounts appearing in Alon and Spencer [5], Serre [7], and Ahlswede and Winter [1] for greater d...
Ngày tải lên: 07/08/2014, 08:20
Báo cáo toán học: " Near Threshold Graphs" ppt
... of threshold graphs – i.e., those graphs having no induced subgraphs equal to either P 4 , C 4 , or 2K 2 . We note that Laplacian matrices for threshold graphs (which are referred to as degree ... Pati, Laplacian spectrum of weakly quasi -threshold graphs, Graphs and Combinatorics, to appear. [2] H. Christianson and V. Reiner, The critical group of a threshold graph, Linear an...
Ngày tải lên: 07/08/2014, 21:21
Báo cáo toán học: "Random even graphs Geoffrey Grimmett" ppt
... uniform random even subgraph of (V, η(ω)). Theorem 3.1. Let p ∈ [0, 1 2 ]. The graph R = (V, γ) is a random even subgraph of G with parameter p. This r ecipe for random even subgraphs provides ... lattice directions, and consider the event A n that R n is traversed from left the electronic journal of combinatorics 16 (2009), #R4 6 16 Random even graphs Geoffrey Grimmett Statist...
Ngày tải lên: 07/08/2014, 21:21
Báo cáo toán hoc:"On Suborbital Graphs for the Normalizer of Γ0(N )" pot
... modular group and generalized Farey graphs, London Math. Soc. Lecture Notes 160, Cambridge University Press, Cam- bridge 1991, 316-338. [8] R. Keskin, On suborbital graphs fo r some Hecke groups, ... Normalizer of Γ 0 (N) Refik Keskin Sakarya Univers ity Faculty of Science and Arts Department of Mathematics 54187 Sakarya/ TURKEY rkeskin@sakarya.edu.tr Bahar Demirt¨urk Sakarya Univers ity...
Ngày tải lên: 08/08/2014, 01:20
Báo cáo toán học: "Integral Cayley graphs defined by greatest common divisors" pot
... numb er of integral graphs on n vertices is estimated. Known characterizations of integral graphs are restricted to certain graph classes, see e.g. [1]. Here we concentrate on integral Cayley graphs ... character matrix H(Γ) with respect to the given ordering of elements becomes the Kronecker product of the character matrix F (r) 2 of Z r 2 and the character matrix F n of Z n , H(Γ)...
Ngày tải lên: 08/08/2014, 14:23
Báo cáo toán học: "Sharp threshold functions for random intersection graphs via a coupling method" potx
... Hopkins University, 1995. [18] Stark, D. The vertex degree distribution of random intersection graphs. Random Structures and Algorithms 24, 249–258, 2004. the electronic journal of combinatorics 18 ... m, p) using intermediate auxiliary random graphs. From them we can deduce the assertion of the theorem. First recall (see for example [8]) that if for some graph valued random variabl...
Ngày tải lên: 08/08/2014, 12:23
Báo cáo toán học: "Random Procedures for Dominating Sets in Graphs" doc
... analyze some random procedures for the construction of small dominating s ets in graphs. Several upper bounds for the domination number of a graph are derived from these p rocedures. Keywords: domination; ... obtain upper bounds on the domination number involve the order of the considered graphs and the degrees of their vertices or just their minimum degree. While there are several resul...
Ngày tải lên: 08/08/2014, 12:22
Báo cáo toán học: " Random approximation with weak contraction random operators and a random fixed point theorem for nonexpansive random self-mappings" pptx
... has a random fixed point are obtained. By introducing a random iteration process with weak contraction random operator, we obtain a convergence theorem of the random iteration process to a random ... iteration process with weak contraction random operator and obtain the convergence the- orem of the random iteration process to a random fixed point for nonexpansive random self-m...
Ngày tải lên: 20/06/2014, 21:20