نتایج جستجو برای: toroidal graphs
تعداد نتایج: 103237 فیلتر نتایج به سال:
Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g ?1). If P V (G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromatic toroidal graphs, for 3-colorable large-width graphs embedded on S g with every face even sided,...
As it is introduced by Bermond, Kodate, and Prennes, some Cayley graphs, including most popular models for interconnection networks, admit a special auto-morphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, optimal gossiping algorithms can be easily designed, and the constructions of the best known edge d...
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3connected planar graphs in the standard torus are chiral. For the case that th...
a toroidalization of a dominant morphism $varphi: xto y$ of algebraic varieties over a field of characteristic zero is a toroidal lifting of $varphi$ obtained by performing sequences of blow ups of nonsingular subvarieties above $x$ and $y$. we give a proof of toroidalization of locally toroidal morphisms of 3-folds.
Let G be a group, and $${{\,\mathrm{Sol}\,}}(G)=\{x \in : \langle x,y \rangle \text { is solvable for all } y G\}$$ . We associate graph $$\mathcal {NS}_G$$ (called the non-solvable of G) with whose vertex set $$G \setminus {{\,\mathrm{Sol}\,}}(G)$$ two distinct vertices are adjacent if they generate subgroup. In this paper, we study many properties particular, obtain results on degree, cardina...
Abstract The intersection power graph of a finite group G G is the whose vertex set , and two distinct vertices x x y y are adjacent if either one identity element or ⟨ ⟩ ∩ \langle x\rangle \cap y\rangle non-trivial. In this paper, we c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید