نتایج جستجو برای: triangular graph
تعداد نتایج: 216655 فیلتر نتایج به سال:
let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...
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...
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...
Derivations, Jordan derivations, as well as automorphisms and Jordan automorphisms of the algebra of triangular matrices and some class of their subalgebras have been the object of active research for a long time [1, 2, 5, 6, 9, 10]. A well-know result of Herstein [11] states that every Jordan isomorphism on a prime ring of characteristic different from 2 is either an isomorphism or an anti-iso...
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 ...
In this paper we discuss the edge-bandwidth of some families of graphs and characterize graphs by edge-bandwidth. In particular, bounds for m × n grids, triangular grids of size l, and the closure of the triangular grid T * l .
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surfaces with arbitrary many variables. The novelty of the algorithm is its generality: there is no restriction on the degree of the B-spline surfaces or on the dimension of the domain. Constructing an evaluation graph allows...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید