نتایج جستجو برای: cartesian product and strong product
تعداد نتایج: 16887447 فیلتر نتایج به سال:
Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph is the minimum number of steps in a graph burning process for that graph. In this paper, we consider the burning number of graph products. We find some general bounds on the burning number of the Cartesian product and the s...
A partition of V (G), all of whose classes are dominating sets in G, is called a domatic partition of G. The maximum number of classes of a domatic partition of G is called the domatic number of G. The concept of a domatic number was introduced in [1]. More interesting results on domatically full graphs, domatically critical, domatically cocritical graphs and other domatic numbers can be found ...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید