Global Structural Properties of Random Graphs
نویسندگان
چکیده
منابع مشابه
Structural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملstructural properties of fuzzy graphs
matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...
متن کاملProperties of Random Difference Graphs
Generate a bipartite graph on a partitioned set of vertices by randomly assigning to each vertex v some weight w(v) ∈ [0, 1] and adding an edge between vertices u and v (in distinct parts) if and only if w(u)+w(v) > 1; the results of such processes are known as difference graphs. Random difference graphs of a given size can be produced either by uniformly random generation of weights or by choo...
متن کاملProperties of Random Graphs via
We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irre-ducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that the number of degree n polynomials of Hamming distance one from a randomly chosen set of 2 n /n ...
متن کاملStructural Properties of Sparse Graphs
Dense graphs have been extensively studied in the context of Extremal Graph Theory. The outstanding Szemerédi Regularity Lemma [111] states that any dense network has properties which are close to the ones of a random graph. In particular, a large dense network cannot be too irregular. This structural result is one of the cornerstones of contemporary combinatorics (and one would like to say mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2016
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rnw287