位置：成果数据库 > 期刊 > 期刊详情页
Maximum Forcing Number of Hexagonal Systems
  • ISSN号：0340-6253
  • 期刊名称：MATCH-Communications in Mathematical and in Comput
  • 时间：2013.6.6
  • 页码：493-500
  • 相关项目：平面三正则图的leapfrog图和亚苯基系统的匹配强迫数
作者： L. Xu, H. Bian, F. Zhang|
同期刊论文项目
平面三正则图的leapfrog图和亚苯基系统的匹配强迫数
期刊论文 23
同项目期刊论文
SomeWiener-type Indices of Subdivision-related and F-sums Graphs
Vertex PI indices of some sums of graphs
Threshold-based Message Copies Control in Delay Tolerant Networks
Reasonable routing in delay/disruption tolerant networks
Message redundancy removal of multi-copy routing in
Extremal Polyphenyl Spiders Concerning k-matchings and k-independent sets
容忍延迟网络中基于生灭模型的消息控制方法
Social Group-based DTN Routing
The hyper-Wiener index of the kth power of a graph
一些运算图的Wiener 极性指数
The Polyphenyl Chains with Extremal Edge-Wiener Indices
基于移动Sink的多拷贝路由冗余消除方法
On the Anti-Kekule and Anti-Forcing Number of Cata-condensed Phenylenes
Extremal polygonal cactus chain concerning k-independent sets
Schultz and Zagreb indices in corona of two graphs
The Hosoya Polynomial Decomposition for Polyphenyl Chains
Social Computing for Routing in Delay Tolerant Networks
Matching polynomials for chains of cycles
容迟网络中基于社会网络的可靠路由