نتایج جستجو برای: triangular and circular graph products
تعداد نتایج: 16894565 فیلتر نتایج به سال:
We calculate Wilson loops in lowest order of perturbation theory for triangular contours whose edges are circular arcs. Based on a suitable disentanglement the relations between metrical and conformal parameters contours, result fits perfectly structure predicted by anomalous Ward identity. The remainder function depends generic 4D case three cusp torsion angles. restrictions these angles impos...
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such graphs triangular grid graphs. Following the analogy, we define the class of solid triangular grid graphs. We prove that the Hamiltonian Cycle problem is NPcomplete for triangular grid graphs. We show that with the ex...
nowadays, air pollution is a global problem that has had significant growth by technology development, population growth andindustrial development. industrial development brought natural resources deterioration, more manufacturing products, and more environmental pollutants. if pollutant won’t be controlled, human-being and wildlife will face the critical risks. significant release and critical...
Our paper has two goals: i) We propose the combinatorial approach to facilitate the calculation of the number of spanning trees for five new classes of graphs. ii) We use a new powerful operation (subdivision) to get larger graphs from a given graph. In particular, we derive the explicit formulas for the subdivision of ladder, fan, triangular snake, double triangular snake and the total graph o...
In this paper, we first introduce a novel class of graphs, namely supergrid. Supergrid graphs include grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for grid graphs and triangular grid graphs were known to be NP-complete. However, they are unknown for supergrid graphs. The Hamiltonian cycle (path) problem on supergrid graphs can be applied to ...
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct graceful labellings never give isomorphic oriented embeddings. Since the number of graceful labell...
Given the algebra T of ternions (upper triangular 2× 2 matrices) over a commutative field F we consider as set of points of a projective line over T the set of all free cyclic submodules of T 2. This set of points can be represented as a set of planes in the projective space over F 6. We exhibit this model, its adjacency relation, and its automorphic collineations. Despite the fact that T admit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید