位置：成果数据库 > 期刊 > 期刊详情页
A linear-time algorithm for paired-domination problem in strongly chordal graphs
  • ISSN号：0020-0190
  • 期刊名称：Information Processing Letters
  • 时间：0
  • 页码：20-23
  • 语言：英文
  • 相关项目：图的标号问题与子图存在性的理论和算法研究
作者： Zeng, Zhenbing|Lu, Changhong|Chen, Lei|
同期刊论文项目
图的标号问题与子图存在性的理论和算法研究
期刊论文 44
同项目期刊论文
图的L(3,2,1)-标号
图和有向图的测地数
有向图的L(j,k)数的上界(英文)
An extremal problem on non-full colorable graphs
Extremal problems on consecutive L(2,1)-labelling
The geodetic numbers of graphs and digraphs
Distance paired-domination problems on subclasses of chordal graphs
The least eigenvalue of unicyclic graphs with n vertices and k pendant vertices
Maximizing the spectral radius of bicyclic graphs with fixed girth
The minimum spectral radius of graphs with a given independence number
Maximizing the Laplacian spectral radii of graphs with given diameter
The minimal Laplacian spectral radius of trees with a given diameter
一类新变换图的基本性质
图的零度综述
Distance-two labellings of Hamming graphs
The Upper and Lower Geodetic Numbers of Graphs
求图中顶点之间所有最短路径的一种算法
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Halin图谱半径的新上界及极图
关于最大度确定的树的谱半径
双圈连通图的L(2，1)-labelling(英文)
度为奇数的正则图的上负全控制数
Constructive characterizations of (gamma(p), gamma)- and (gamma(p), gamma(pr))-trees
求图中受顶点数限制的所有最短路径的算法
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
具有k条割边的极图
变换图的正则性和谱半径
具有次大和第三大谱半径的n阶2-树
具有特殊工件的平行机在线排序问题
树的Nordhaus—Gaddum类型谱半径的排序
Constructive characterizations of （γp, γ）- and （γp, γpr）-trees
有向图的L（j,k）数的上界
双圈连通图的L（2，1）-labelling
ON THE NUMBER OF INCREASING PATHS IN LABELED CYCLES AND STARS
Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter
The L（3,2, 1）-labeling on Bipartite Graphs
一类连通可满着色图的L（2,1）标号