补树的扩充侧廓

数学季刊 ›› 2010, Vol. 25 ›› Issue (4): 515-521.

补树的扩充侧廓

Department of Mathematics, Huanghuai University

收稿日期:2007-12-10 出版日期:2010-12-30 发布日期:2023-05-17
作者简介:ZHANG Zhen-kun(1971-), male, native of Runan, Henan, an associate professor of Huanghuai University, Ph.D., engages in graph theory and combinatorial optimization.
基金资助:
Supported by the Natural Science Foundation of Henan Province(082300460190)； Supported by Program for Science and Technology Innovation Talents in Universities of Henan Province (2010HASTIT043)；

The Extended Profiles of the Co-trees

Department of Mathematics, Huanghuai University

Received:2007-12-10 Online:2010-12-30 Published:2023-05-17
About author:ZHANG Zhen-kun(1971-), male, native of Runan, Henan, an associate professor of Huanghuai University, Ph.D., engages in graph theory and combinatorial optimization.
Supported by:
Supported by the Natural Science Foundation of Henan Province(082300460190)； Supported by Program for Science and Technology Innovation Talents in Universities of Henan Province (2010HASTIT043)；

摘要/Abstract

摘要： The extended profile problem is to find a proper interval supergraph with the smallest possible number of edges. The problem stems from the storage and elimination techniques of a sparse symmetric matrix A in 1950's. It has important applications in numerical algebra, VLSI designs and molecular biology. A tree T is a connected acyclic graph. The complement of a tree T is called a co-tree, denoted by Tˉ. In this paper the exact extended profile value of a cotree Tˉ is given.

关键词: the proper interval graph, the extended profile, tree, co-tree

Abstract: The extended profile problem is to find a proper interval supergraph with the smallest possible number of edges. The problem stems from the storage and elimination techniques of a sparse symmetric matrix A in 1950's. It has important applications in numerical algebra, VLSI designs and molecular biology. A tree T is a connected acyclic graph. The complement of a tree T is called a co-tree, denoted by Tˉ. In this paper the exact extended profile value of a cotree Tˉ is given.

Key words: the proper interval graph, the extended profile, tree, co-tree

中图分类号:

O157.5

张振坤, 高风昕. 补树的扩充侧廓[J]. 数学季刊, 2010, 25(4): 515-521.

ZHANG Zhen-kun, GAO Feng-xin. The Extended Profiles of the Co-trees[J]. Chinese Quarterly Journal of Mathematics, 2010, 25(4): 515-521.

[1]	张振坤, 叶稀琼. K 割宽临界树的构造[J]. 数学季刊, 2022, 37(4): 366-379.
[2]	居腾霞, 吴美云. 单位群Z_n*上的迭代图的圈结构[J]. 数学季刊, 2014, 29(4): 565-572.
[3]	林浩, 林澜. 图的最小控制树问题[J]. 数学季刊, 2014, 29(1): 1-8.
[4]	冶成福. Hosoya指标在一个闭区间的一类树的刻画[J]. 数学季刊, 2012, 27(2): 308-316.
[5]	刘鸣放, 曹济伟, 陈绍春. 四阶椭圆方程的一个十六参数能量正交四面体元[J]. 数学季刊, 2011, 26(3): 388-393.
[6]	谭尚旺. 关于树的拉普拉斯谱半径[J]. 数学季刊, 2010, 25(4): 615-625.
[7]	马丽娜, 陈爽, 罗蕴玲, 李乃华. 树上奇偶马尔可夫链场上的若干强极限定理[J]. 数学季刊, 2010, 25(4): 550-558.
[8]	陈宏宇, 朱柘琍. 连通控制数与2-连通控制数相等的一类图[J]. 数学季刊, 2010, 25(1): 98-103.
[9]	李晓娟, 张昭. 树的线图的P₃-因子[J]. 数学季刊, 2009, 24(3): 333-337.
[10]	程伟, 谭尚旺. 关于给直径的(m,n)-树的最大谱半径[J]. 数学季刊, 2006, 21(1): 129-137.
[11]	董桂香, 陈东灵, 许振宇. 最大度等于5的2-连通的1-树图的边面色数[J]. 数学季刊, 2004, 19(1): 90-94.
[12]	谭尚旺, 郭纪明, 亓健. 直径石d的树的谱半径[J]. 数学季刊, 2004, 19(1): 57-62.
[13]	叶继昌, 徐寅峰, 徐成贤. 关于单位正方形内n个点的最小生成树问题[J]. 数学季刊, 1999, 14(2): 76-82.