位置：成果数据库 > 期刊 > 期刊详情页
New method for counting the number of spanning trees in a two-tree network
  • ISSN号：0378-4371
  • 期刊名称：Physica A: Statistical Mechanics and Its Applicati
  • 时间：2013.10.1
  • 页码：4576-4583
  • 相关项目：基于超图理论的复杂网络模型构建及性质研究
作者： Xiao, Yuzhi|Zhao, Haixing|
同期刊论文项目
基于超图理论的复杂网络模型构建及性质研究
期刊论文 58
同项目期刊论文
字典乘积网络的支撑树计数
直径为3的有向树的回归性的界
A new class of the planar networks with high clustering and high entropy
字典乘积图的点转发数
基于判别式藏语依存句法分析
藏文数词识别与翻译
On the Research of Internet Equipment Naming Methods
Chromaticity of Complete 5-Partite Graphs with Certain Star or Matching Deleted
Controllability of Deterministic Networks with the Identical Degree
基于超图的超网络相继故障分析
On the Atom-Bond Connectivity Index of Two-Trees
Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles
On the Distributions of Subgraph Centralities in Complex Networks
GDURT演化模型的拓扑性质
推广的确定性均匀递归树演化模型的拓扑性质
On the Estrada index of cactus graphs
On the equitable vertex arboricity of complete tripartite graphs
The equitable vertex arboricity of complete tripartite graphs
Scientific Collaboration Network Based on MATCH Communicaitons in Mathematical and in Computer Chemi
Enumeration of spanning trees in planar unclustered networks
Topological Properties of a 3-Regular Small World Network
和谐统一混合择优网络模型耦合映像格子的相继故障
字典乘积图的点转发指数
有向图字典乘积的代数群性质
基于超图理论的在线社会网络用户行为分析
一种超网络演化模型构建及特性分析
基于超图结构的科研合作网络演化模型
New method for counting the number of spanning tree in a two-tree network
On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
Chromaticity of complete 6-partite graphs with certain star or matching deleted II
动态复杂供需网络局域演化模型的研究
Signless Laplacian Characteristic Polynomials of Complete Multipartite Graphs
On the Seidel Integral Complete Multipartite Graphs
A small-world network derived from the deterministic uniform recursive tree by line graph operation
Chromaticity of Complete 6-Partite Graphs with Certain Star or Matching Deleted
一类树的SL谱刻画
由Signless Laplacian谱确定的一类奇单圈图
On the Transitivity of the Strong Product of Graphs
基于复杂网络的地方产品网络营销分析