典型文献
Ergodicity of Bandwidth and Cutwidth on Families of Graphs and Trees
文献摘要：
Bandwidth,cutwidth,cyclic bandwidth,bandwidth sum and cyclic bandwidth sum are well-known indices about optimal labeling of graphs applied in VLSI design,network communications,and other areas involving the graph layout.To design the graphs with the given indices,we need to study the ergodicity.Let F be a set of graphs under consideration and φ an integer-valued function defined on F,namely,φ is an index,such as bandwidth and cutwidth.If there exists a graph G ∈F such that φ(G)=x for any integer x in the interval[a,b],where a and b are the minimum and maximum of φ on F,respectively,then φ is said to have ergodicity on F.Let Gn be the set of simple connected graphs with order n and Tn the set of trees with order n.In this paper,we investigate the ergodicity of bandwidth,cutwidth,cyclic bandwidth,the bandwidth sum and cyclic bandwidth sum on Tn and Gn.
文献关键词：
中图分类号：
作者姓名：
LIN Yi-shu;CHANG Cai-bing;LIU Yan
作者机构：
School of Internet Finance and Information Engineering,Guangdong University of Finance,Guangzhou 510000,China;School of Mathematical Science,South China Normal University,Guangzhou 510000,China
文献出处：
引用格式：
[1]LIN Yi-shu;CHANG Cai-bing;LIU Yan-.Ergodicity of Bandwidth and Cutwidth on Families of Graphs and Trees)[J].数学季刊（英文版）,2022(04):355-365
A类：
Ergodicity,Cutwidth,cutwidth
B类：
Bandwidth,Families,Graphs,Trees,cyclic,bandwidth,sum,well,known,indices,about,optimal,labeling,graphs,applied,VLSI,design,network,communications,other,areas,involving,layout,To,given,need,study,ergodicity,Let,set,under,consideration,integer,valued,function,defined,namely,such,If,there,exists,that,any,interval,where,minimum,maximum,respectively,then,said,have,Gn,simple,connected,order,Tn,trees,In,this,paper,investigate
AB值：
0.455265
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
