2. 您的位置
3. 首页
4. 会议论文
5. Some Results on Optimal Labeling of Graphs

Some Results on Optimal Labeling of Graphs

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户：hfs191

【摘 要】

：

　　Let G be a graph,B(G),Bc(G),BS(G),BSc(G)and C(G)be the band-width,cyclic bandwidth,bandwidth sum,cyclic bandwidth sum and cutwidth of G,respectively.

【作 者】

：

Yan Liu 

【机 构】

：

SchoolofMathematicalScience,SouthChinaNormalUniversity

【出 处】

：

第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The

【发表日期】

：

2015年7期

下载到本地 , 更方便阅读

下载此文 赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　Let G be a graph,B(G),Bc(G),BS(G),BSc(G)and C(G)be the band-width,cyclic bandwidth,bandwidth sum,cyclic bandwidth sum and cutwidth of G,respectively.

其他文献

On Star-wheel Ramsey Numbers

　　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

会议

Fault-tolerance of Balanced Hypercubes with Faulty Vertices and Faulty Edges

　　Interconnection network is important for parallel processing which have been developed on cycle-embedding or path-embedding.Since failure may occur when a n

会议

The Permanental Polynomials of Graphs

　　Pólyas problem concerns the conversion of the permanent and determinant of a matrix.As a generalization of this problem,this topic focus on the conversion

会议

On the Erdos Conjecture

　　Given a graph H,what is the maximum number of edges of a graph with n vertices not containing H as a subgraph? This number is denoted ex(n,H),and is known a

会议

Hiltons Conjecture on Incomparable and Uncomplemented Families of Sets

　　Let A1,…,Ak be families of distinct subsets of [n].These families are incomparable if no set in one family is contained in a set in another family.A family

会议

Some Results on Judicious k-partitions of Graphs

　　In this talk,we shall introduce some results on judicious k-partitions of graphs,which improve the main results of [B,Xu,X.Yu,Better bounds for k-partitions

会议

A New Clustering Approach for Signed Networks Based on Edge-betweenness Centrality and Density of Su

　　Clustering algorithms for unsigned networks which have only positive edges have been studied intensively.However,when a network has like/dislike,love/hate,r

会议

Some Sufficient Conditions for gc-coloring of Simple Graph

　　A gc-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v)times.The maximum integer k such that G has a g

会议

NP-completeness of Anti-Kekulé and Matching Preclusion Problems

　　Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of the molecules.Matching preclusion and conditional matching pr

会议

Laplacian Spectral Characterization of Some Double Starlike Trees

　　A tree is called double starlike if it has exactly two vertices of degree greater than two.Let H(p,n,q)denote the double starlike tree obtained by attaching

会议