图的侧廓问题的一些界(英文)  

Some Bounds on the Profile of Graphs

作　　者：郝建修[1] 

机构地区：[1]浙江师范大学数学系,浙江金华321004

出　　处：《河南科学》2007年第2期194-196,共3页Henan Science

基　　金：National The Project Supported by Zhejiang Provincial Natural Science Foundation of China(102055);Naturen Science Foundation of China(No.10471131);The Foundation of Zhejiang Universities Youth Teachers

摘　　要：侧廓问题是:寻找一个从V(G)到正整数集合｛1,2,…,│V(G)│｝的一个一一对应,让x∈V(G)∑ (f(x)-min f(y)尽可能小,这里y∈N*(x),N*(x)是x的闭领域.本文提供这个问题的两个结果.The profile minimization problem is to find a one-to-one mappingf from the vertex set V（G）of a graph G tothe set of positive integers{1, 2 ｜ V（G）｜} such that ∑x∈V（G（f（x）-minf（y）y∈N^＊（x） is as small as possible, where N^＊（x） is the closed neighborhood of x in G. This paper presents two results on the problem.

关 键 词：稀疏矩阵 侧廓 标号 轮廓 线性布置 

分 类 号：O157[理学—数学]