位置：成果数据库 > 期刊 > 期刊详情页
T-型树谱唯一性的一个简单刻画
  • ISSN号：1006-6837
  • 期刊名称：《数学研究》
  • 时间：0
  • 分类：O157.5[理学—数学;理学—基础数学]
  • 作者机构：[1]西安交通大学理学院,陕西西安710049
  • 相关基金：国家自然科学基金资助（10231060）
作者： 王卫[1], 徐成贤[1]
关键词： 图的谱, 谱相同的图, 谱半径, 谱唯一性, Speetra of graphs, Cospeetral graphs, Spectral radius, Spectral uniqueness
中文摘要：

图G称为谱唯一的，如果任何与G谱相同的图一定与G同构．一棵树称为T-型树如果其仅有一个最大度为3的顶点．本文给出了T-型树谱唯一性的一个简单刻画，从而完全解决了T-型树的谱唯一性问题．

英文摘要：

A graph G is said to be spectral unique, if any graph that is cospectral with G is isomorphic to G. A T-shape is a tree with exactly one of its vertices having maximal degree 3. In this paper, a simple characterization for a T-shape tree to be spectral unique is given, which completely solve the problem of the spectral u- niqueness of T-shape trees.

同期刊论文项目
大规模优化算法，理论以及应用
期刊论文 89 会议论文 12 著作 3
同项目期刊论文
Linear systems associated with
A nonmonotone second order ste
Convergence properties of mult
A 3-approximation algorithm fo
Nonmonotone adaptive trust reg
An adaptive trust-region metho
An excluding algorithm for tes
Solving non-additive traffic a
An outcome-space finite algori
Optimal preemptive online sche
Theoretical and numerical comp
A branch and bound algorithm f
A Feasible Direction Algorithm
股指期货定价方法研究
Mean-variance portfolio optima
On maximizing the throughput?
Non-monotone trust region meth
A truly globally convergent fe
A practical penalty trust-regi
Properties of Hadamard Product
Some results on resource const
Convergence of an inexact smoo
A multiple penalty function me
A new linearization method for
A Subspace implementation of
An adaptive approach of conic
Nonmonotone descent algorithm
On the quadratic convergence o
Duality and Lagrange multiplie
A new two level linear relaxed
Conic Trust region method for
Mixed duality without a constr
A new modified Goldstein-Levit
New decomposition methods for
一个求解大规模优化的有限内存方
关于非负不可约矩阵的广义Perron
A proximal decomposition algor
A trust region method for solv
On-line scheduling with extend
Computing a Celis-Dennis-Tapia
A new stepsize for the steepes
A Class of globally convergent
Adaptive nonmonotone trust reg
Alternate minimization gradien
An effective continuous algori
A nonmonotone line search algo
The application of log barrier
An optimal self-scaling strate
A nonsmooth trust region algor
A simpler proof on global conv
H-Matrices and S-Doubly Diagon
Proximal point algorithm for m
Analysis of monotone gradient
Optimality and mixed duality f
Maximizing the total profit of
Optimality and duality without
Convergence and regularity of
Feasible SQP Descent Method for Inequality Constrained Optimization Problems and Its Convergence
一个自动确定信赖域半径的信赖域方法
二次指派问题的Gilmore-Lawler界的改进
求解二次半定规划的原对偶内点算法
一种新的二次插值模型算法
T-型树T(1,l,m)可由其谱唯一决定
不动点与稳定点存在性关系及判定定理
带有线搜索的新的非单调自适应信赖域算法
A NEW SQP-FILTER METHOD PROGRAMMING FOR SOLVING NONLINEAR PROBLEMS
基于稀疏主成分的股票指数追踪研究
优化矿井通风系统方案的灰色关联模型
LC^1无约束优化问题的非单调线搜索算法
ON THE SEPARABLE NONLINEAR LEAST SQUARES PROBLEMS
COMPUTE A CELIS-DENNIS-TAPIA STEP
VaR模型及其在上海股市中的应用
复合非光滑优化的一种非单调线搜索方法
AN OPTIMAL SELF-SCALING STRATEGY TO THE MODIFIED SYMMETRIC RANK ONE UPDATING
DISTURBED SPARSE LINEAR EQUATIONS OVER THE 0-1 FINITE FIELD
A NEW STEPSIZE FOR THE STEEPEST DESCENT METHOD
CONVERGENCE PROPERTIES OF MULTI-DIRECTIONAL PARALLEL ALGORITHMS FOR UNCONSTRAINED MINIMIZATION
A FEASIBLE DIRECTION ALGORITHM WITHOUT LINE SEARCH FOR SOLVING MAX-BISECTION PROBLEMS
A Switching Algorithm Based on Modified Quasi-Newton Equation
AN ADAPTIVE NONMONOTONIC TRUST REGION METHOD WITH CURVILINEAR SEARCHES
一个解无约束优化问题的过滤信赖域方法
A NONMONOTONE SECOND-ORDER STEPLENGTH METHOD FOR UNCONSTRAINED MINIMIZATION
AN EFFECTIVE CONTINUOUS ALGORITHM FOR APPROXIMATE SOLUTIONS OF LARGE SCALE MAX-CUT PROBLEMS
Nonmonotone Adaptive Trust Region Algorithms with Indefinite Dogleg Path for Unconstrained Minimization
期刊信息
  • 《数学研究》
  • 主管单位:厦门大学
  • 主办单位:厦门大学数学科学学院 福建省数学会
  • 主编：林群
  • 地址：厦门大学数学系
  • 邮编：361005
  • 邮箱：jmaths@xmu.edu.cn
  • 电话：0592-2580752 21828321
  • 国际标准刊号：ISSN：1006-6837
  • 国内统一刊号：ISSN：35-1177/O1
  • 邮发代号:
  • 获奖情况:
  • 国内外数据库收录:
  • 美国数学评论（网络版）,德国数学文摘
  • 被引量:1284