共查询到18条相似文献,搜索用时 62 毫秒
1.
一个图G的区间图完全化问题包含两类子问题:侧廓问题和路宽问题,分别表示为P(G)和PW(G),其中侧廓问题是寻求G的一个边数最小的区间超图;路宽问题是寻求G的一个团数最小的区间超图.这两类子问题分别在数值代数、VLSI-设计和算法图论等学科领域中有重要的应用.对一般图来说,两类子问题都是NP-完全问题;但是对一些特殊图类来说,它们在多项式时间内可解.本文给出了树T的补图的具体侧廓和路宽值. 相似文献
2.
引入图的弱准带宽和前沿带宽,并将其应用于研究图的带宽、拓扑带宽、填充、侧廓、路宽和树宽等. 相似文献
3.
起源于稀疏矩阵计算和其它应用领域的一个图G的最小填充问题就是在G中寻找一个边数| F |最小的添加边集F,使得G+F是弦图.这里最小值| F |称为图G的填充数,表示为f(G).对一般图来说,这个问题是NP-困难问题.一些特殊图类的最小填充问题已被研究.本文给出了序列平行图G的最小填充数的具体值. 相似文献
4.
5.
图和线图的谱性质 总被引:5,自引:0,他引:5
陈晏 《高校应用数学学报(英文版)》2002,17(3):371-376
Let G be a simple connected graph with n vertices and m edges,Lo be the line graph of G and λ1(LG)≥λ2 (LG)≥...≥λm(LG) be the eigenvalues of the graph LG,.. In this paper, the range of eigenvalues of a line graph is considered. Some sharp upper bounds and sharp lower bounds of the eigenvalues of Lc. are obtained. In oarticular,it is oroved that-2cos(π/n)≤λn-1(LG)≤n-4 and λn(LG)=-2 if and only if G is bipartite. 相似文献
6.
7.
给出了一类特殊的广义deBruijn有向图的支撑树与欧环游的数目的简洁表示式,并得到了广义deBruijn有向叠线图的支撑树与欧拉环境数目的计算公式。 相似文献
8.
9.
10.
如果图G有一个生成子图使得这个生成子图的每一个分支都是3个点的路,则称G有P3-因子.本文证明了对任何一个2-边连通图G,只要G的边数能被3整除,则G的线图就有P3-因子。 相似文献
11.
The interval graph completion problem of a graph G includes two class problems: the profile problem and the pathwidth problem, denoted as P(G) and PW(G) respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI-layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite Graph Kn1,n2,…,nr(r≥2) are determined. 相似文献
12.
《Journal of Graph Theory》2017,84(1):26-44
The celebrated grid exclusion theorem states that for every h‐vertex planar graph H , there is a constant such that if a graph G does not contain H as a minor then G has treewidth at most . We are looking for patterns of H where this bound can become a low degree polynomial. We provide such bounds for the following parameterized graphs: the wheel , the double wheel , any graph of pathwidth at most 2 , and the yurt graph . 相似文献
13.
15.
图的最小填充的分解定理 总被引:18,自引:0,他引:18
在计算数学领域,稀疏矩阵的最小填充排序问题由于其重要的实际意义而受到重视。本文从图论的观点提出一种处理方法,即运用分解定理来处理一些特殊结构,从而导出一些特殊图的最小填充数。 相似文献
16.
设H是阶为n的连通图.在H的某一个顶点上悬挂一棵阶为j的树,得到图H_j,用H_j表示这样的图形族.本文证明:当j充分大时,有r(G,H_j)=(x(G)-1)(n+j-1)+s(G),其中x(G),s(G)分别表示图G的色数和色数剩余. 相似文献
17.
Chip-Firing and the Critical Group of a Graph 总被引:12,自引:0,他引:12
N.L. Biggs 《Journal of Algebraic Combinatorics》1999,9(1):25-45
A variant of the chip-firing game on a graph is defined. It is shown that the set of configurations that are stable and recurrent for this game can be given the structure of an abelian group, and that the order of the group is equal to the tree number of the graph. In certain cases the game can be used to illuminate the structure of the group. 相似文献
18.
本文将一个关于两个不交国的单点粘合的图的LPlaCe谱的受控定理推广到了两个国的多点粘合何形;同时证明了相同的结果对目的Q一回也成立。 相似文献