منابع مشابه
Random Subgraphs of the 2d Hamming Graph: the Supercritical Phase
We study random subgraphs of the 2-dimensional Hamming graph H(2, n), which is the Cartesian product of two complete graphs on n vertices. Let p be the edge probability, and write p = 1+ε 2(n−1) for some ε ∈ R. In [4, 5], the size of the largest connected component was estimated precisely for a large class of graphs including H(2, n) for ε ≤ ΛV −1/3, where Λ > 0 is a constant and V = n denotes ...
متن کاملConnectivity threshold for random subgraphs of the Hamming graph
We study the connectivity of random subgraphs of the d-dimensional Hamming graph H(d, n), which is the Cartesian product of d complete graphs on n vertices. We sample the random subgraph with an i.i.d. Bernoulli bond percolation onH(d, n) with parameter p. We identify the window of the transition: when np−logn → −∞ the probability that the graph is connected goes to 0, while when np − logn → +∞...
متن کاملthe effect of aqueous extract of garlic on formalin-induced pain in male rats
چکیده اثر عصاره آبی سیر بر درد ناشی از آزمون فرمالین در موش صحرایی نر به کوشش نرگس اسکندری روزبهانی زمینه و هدف: گیاه سیر از خانواده لیلیاسه و گونهallium sativum بومی آسیای میانه بوده و از دوران ،باستان تاکنون به خواص درمانی متفاوت آن مثل: کاهندگی قندخون، کلسترول خون، فشار خون، اثرات مفیدآن بر دستگاه قلبی عروقی و بیماریهای انعقادی خون، اثرات آنتی اکسیداتیو، درمان بیماریهای تنفسی وگوارشی، ا...
15 صفحه اولOn the number of distinct induced subgraphs of a graph
Let G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k > 1. We prove that if i(G) = o(n k+ ') then by omitting o(n) vertices the graph can be made (l, m)-almost canonical with 1 + m < k + 1 .
متن کاملCharacterizing subgraphs of Hamming graphs
Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the following two conditions: (i) incident edges receive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22640