共查询到16条相似文献,搜索用时 62 毫秒
1.
2.
程钊 《数学的实践与认识》2013,43(1)
考察了图论中若干重要定理的历史背景,这些定理包括图论基本定理,矩阵-树定理,门格尔定理,霍尔定理,柯尼希定理,塔特定理,彼得森定理,库拉托夫斯基定理,布鲁克斯定理和维津定理. 相似文献
3.
4.
数学黑洞问题的图论表示李鸿祥(上海铁道大学)张芝兰(上海市邮电学校)在文[1]中我们指出,当K变换被修改为“将某规定位数的数的所有数字重新排列,组成可能的最大数和最小数,然后相减得同位差数”(可简称为“重排求差”变换)后,四位数和三位数的K变换黑洞分... 相似文献
5.
本为1994年全国大学生数学建模竞赛B题(锁具装箱)中关于锁具总数的求解提供一种茼便易行的田论算法.只需具备最基本的图论知识,即可掌握该算法,而运用该算法,计算盘将比现有各种求解算法少得多. 相似文献
6.
本文为1994年全国大学生数学建模竞赛B题(锁具装箱)中关于锁具总数的求解提供一种简便易行的图论算法.只需具备最基本的图论知识,即可掌握该算法,而运用该算法,计算量将比现有各种求解算法少得多 相似文献
7.
9.
用反例证明了文[1]中的最大独立集算法和最小支配集算法的结论都是错误的,因而图论中独立支配集的求解问题并没有解决. 相似文献
10.
11.
12.
本文中我们证明几个关于克希霍夫矩阵的新定理.在这些定理下,代数图论中Temperly,Kelmans,以及Fiedler提出的一些早期定理成为直接的推论. 相似文献
13.
Dragan Stevanovi? 《Linear algebra and its applications》2007,423(1):172-181
This is a collection of open problems presented at the Aveiro Workshop on Graph Spectra held at the University of Aveiro, Portugal from April 10-12, 2006. 相似文献
14.
图的扩张与稀疏矩阵计算中的若干优化问题 总被引:5,自引:1,他引:4
本文研究从稀疏矩阵计算中提出的若干离散最优化问题,即带宽,树宽,路宽,侧廓,扩充侧廓及填充问题。实际上,它们是一类图扩张问题;这些问题同时来源于各式各样的课题,如图子式理论,VLSI电路设计,互联网络及分子生物学等,本文从图论观点着重讨论两种统一途径:图的标号及图的扩张。 相似文献
15.
Let N denote the set of positive integers.The sum graph G (S) of a finite subset S (C) N is the graph (S,E) with uv ∈ E if and only if u v ∈ S.A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S С N.By using the set Z of all integers instead of N,we obtain the definition of the integral sum graph.A graph G=(V,E) is a mod sum graph if there exists a positive integer z and a labelling,λ,of the vertices of G with distinct elements from {0,1,2,...,z-1} so that uv ∈ E if and only if the sum,modulo z,of the labels assigned to u and v is the label of a vertex of G.In this paper,we prove that flower tree is integral sum graph.We prove that Dutch m-wind-mill (Dm) is integral sum graph and mod sum graph,and give the sum number of Dm. 相似文献
16.
Let N denote the set of positive integers. The sum graph G^+(S) of a finite subset S belong to N is the graph (S, E) with uv ∈ E if and only if u + v ∈ S. A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S belong to N. By using the set Z of all integers instead of N, we obtain the definition of the integral sum graph. A graph G = (V, E) is a mod sum graph if there exists a positive integer z and a labelling, λ, of the vertices of G with distinct elements from {0, 1, 2,..., z - 1} so that uv ∈ E if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. In this paper, we prove that flower tree is integral sum graph. We prove that Dutch m-wind-mill (Dm) is integral sum graph and mod sum graph, and give the sum number of Dm. 相似文献