نتایج جستجو برای: edge transitive graphs
تعداد نتایج: 203876 فیلتر نتایج به سال:
We use a correspondence between Graphs1 and finite subsets of certain semigroups (the factorial and commutative ones, for example R\{0} if R is a unique factorization domain) and the Graph Minor Theorem to get a characterization of infinite sequences of finite subsets of those semigroups. Especially interesting is the case if N is the regarded semigroup. 1. Some aspects of Graph (Minor) Theory ...
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set difference; projection; coprojection; converse; transitive closure; and the...
We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets then lead to minimal highly symmetric generating sets of the symmetric group. We show that there exist generating sets among these with edge-transitive Cayley graphs and investigate them in relation to the Lovasz conjecture.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید