位置：成果数据库 > 期刊 > 期刊详情页
Determining which Fibonacci (p, r)-cubes can be Z-transformation graphs
  • ISSN号：0012-365X
  • 期刊名称：Discrete Mathematics
  • 时间：2011.8.8
  • 页码：1681-1692
  • 相关项目：若干网络的拓扑结构特征,高阶限制边连通度和容错连通控制集
作者： Ou, Lifeng|Zhang, Heping|Yao, Haiyuan|
同期刊论文项目
若干网络的拓扑结构特征,高阶限制边连通度和容错连通控制集
期刊论文 18
同项目期刊论文
Super restricted edge-connectivity of graphs with diameter 2
l(1)-embeddability under the edge-gluing operation on graphs
Fibonacci (p, r)-cubes which are median graphs
Prescribed matchings extend to__ Hamiltonian cycles in hypercubes with faulty edges
On the global forcing number of hexagonal systems
Decomposition theorem on matchable distributive lattices
Fibonacci (p,r)-cubes which are partial cubes
On Construction of Quality Fault-Toletant Virtual Backbone in Wireless Networks
Super s-restricted edge-connectivity of vertex-transitive graphs
Matching preclusion for balanced hypercubes
A Relation between Clar Covering Polynomial and Cube Polynomial
On Diameter Stability of the Johnson Graph
Hyper-Hamiltonian laceability of balanced hypercubes
Bondage number of strong product of two paths