【摘 要】
：
Interconnection network is important for parallel processing which have been developed on cycle-embedding or path-embedding.Since failure may occur when a n
【机 构】
：
DepartmentofMathematics,BeijingJiaotongUniversity,Beijing,100044,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
Interconnection network is important for parallel processing which have been developed on cycle-embedding or path-embedding.Since failure may occur when a network is put into use,this motivates to consider cycle-embedding problems in some networks with faulty edges or faulty nodes.
其他文献
Let G be a graph and id(v) denote the implicit degree of a vertex v in G.An induced subgraph H of G is called f-implicit-heavy if max{id(x),id(y)}≥|V(G)|/2
若G中长为r+tj+i的圈恰好有pi(0≤i≤t-1)个,其中∑t-1i=0pi=t,r+tj+i-1≤n,则称G为r-(p0,…,pt-1)-泛圈图。本文主要采用构造法,给出当t=8时r-(p0,…,pt-1)-泛圈图的一
A mixed hypergraph is a hypergraph containing two families of edges: C-edges and D-edges.In a proper coloring of the vertices,every C-edge must have two ver
The equitable coloring problem,introduced by Meyer in 1973,has received considerable attention and research.Recently,Wu et al.introduced the concept of equi
A total-k-adjacent vertex distinguishing-coloring of G is a(proper)total-k-coloring of G such that any pair of adjacent vertices have distinct sets of color
In this paper,we propose a novel approach based on nonlocal means,total variation-regularization and sparse coding.Firstly,LR image is denoised by using non
For two given graphs G1 and G2,the planar Ramsey number PR(G1;G2)is the smallest integer N such that every planar graph G on N vertices,either G contains G1
A total-[k]-coloring of a graph G is a mappingφ:V(G)∪E(G)→ {1,2,…,k} such that any two adjacent elements in V(G)∪E(G)receive di erent colors.
A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G),G-v is Hamiltonian.A graph is supereulerian if it has a spanning Eulerian subgrap
Let G be a 2-edge-connected simple graph on n≥14 vetices,and let A denote an abelian group with the identity element 0.If a graph G* is obtained by repeate