نتایج جستجو برای: von mise graphs
تعداد نتایج: 198093 فیلتر نتایج به سال:
The architectural setting of gardens, reflected in their layouts, comprises some of the most important characteristics and features of these open spaces. In addition to the remained historic monuments, documents and texts, Persian poems represent a valuable source for garden study which depict garden images in many cases. The images might be either extracted from poet's direct observation or hi...
We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni and Vergne using techniques of residues. In contrast with their approach, we provide combinatorial proofs inspired by the work of Postnikov and Stanley on f...
a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.
the total version of geometric–arithmetic index of graphs is introduced based on the endvertexdegrees of edges of their total graphs. in this paper, beside of computing the total gaindex for some graphs, its some properties especially lower and upper bounds are obtained.
the center (periphery) of a graph is the set of vertices with minimum (maximum)eccentricity. in this paper, the structure of centers and peripheries of some classes ofcomposite graphs are determined. the relations between eccentricity, radius and diameterof such composite graphs are also investigated. as an application we determinethe center and periphery of some chemical graphs such as nanotor...
we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...
In [5] Lenz and Stollmann proved the existence of the integrated density of states in the sense of uniform convergence of the distributions for certain operators with aperiodic order. The goal of this paper is to establish a relation between aperiodic order, uniform spectral convergence and the continuous algebras invented by John von Neumann. We illustrate the technique by proving the uniform ...
This paper extends the Birkhoff-von Neumann unicast switching strategy to the multicast case. Using a graph theoretic model we show that the rate region for a traffic pattern is precisely the stable set polytope of the pattern’s ‘conflict graph’, in the no-fanout splitting case. Computing the offline schedule is equivalent to fractional weighted graph coloring which takes polynomial time for pe...
A system to be developed is expected to provide solution of a problem. After a careful identification of domains, an explicit, precise and well-engineered description is essential to develop an accurate solution providing system. Machine domain is formal while problem domain is informal. Description is like a platform for the developers to start and finish the development activities. Four princ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید