نتایج جستجو برای: Random Graph
تعداد نتایج: 464574 فیلتر نتایج به سال:
we investigate two constructions - the replacement and the zig-zag product of graphs - describing several fascinating connections with combinatorics, via the notion of expander graph, group theory, via the notion of semidirect product and cayley graph, and with markov chains, via the lamplighter random walk. many examples are provided.
a set $s$ of vertices of a graph $g=(v,e)$ without isolated vertex is a {em total dominating set} if every vertex of $v(g)$ is adjacent to some vertex in $s$. the {em total domatic number} of a graph $g$ is the maximum number of total dominating sets into which the vertex set of $g$ can be partitioned. we show that the total domatic number of a random $r$-regular graph is almost...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید