Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations
出版年份 2023 全文链接
标题
Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations
作者
关键词
-
出版物
COMPUTER JOURNAL
Volume -, Issue -, Pages -
出版商
Oxford University Press (OUP)
发表日期
2023-09-23
DOI
10.1093/comjnl/bxad090
参考文献
相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- (2022) Danyi Li et al. ADVANCES IN APPLIED MATHEMATICS
- On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees
- (2022) Yu Yang et al. INFORMATION AND COMPUTATION
- The number of subtrees in graphs with given number of cut edges
- (2021) Kexiang Xu et al. DISCRETE APPLIED MATHEMATICS
- On the maximum mean subtree order of trees
- (2021) Stijn Cambie et al. EUROPEAN JOURNAL OF COMBINATORICS
- The two-layer Ising model on a sequence of diamond-like hierarchical lattices
- (2021) G.D. Anisimova et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network
- (2021) Jing Liang et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Fractality and the small-world property of generalised (u, v)-flowers
- (2020) Nobutoshi Ikeda CHAOS SOLITONS & FRACTALS
- Algorithms Based on Path Contraction Carrying Weights for Enumerating Subtrees of Tricyclic Graphs
- (2020) Yu Yang et al. COMPUTER JOURNAL
- The expected subtree number index in random polyphenylene and spiro chains
- (2020) Yu Yang et al. DISCRETE APPLIED MATHEMATICS
- On the mean subtree order of graphs under edge addition
- (2020) Ben Cameron et al. JOURNAL OF GRAPH THEORY
- Entropy and Enumeration of Subtrees in a Cactus Network
- (2020) Lixin Dong et al. Frontiers in Physics
- Two-point resistances in a family of self-similar (x,y)-flower networks
- (2019) Yingmin Shangguan et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Subtrees of graphs
- (2018) Alex J. Chin et al. JOURNAL OF GRAPH THEORY
- Maximizing the mean subtree order
- (2018) Lucas Mol et al. JOURNAL OF GRAPH THEORY
- Tutte Polynomials of Two Self-similar Network Models
- (2018) Yunhua Liao et al. JOURNAL OF STATISTICAL PHYSICS
- Tutte Polynomial of Scale-Free Networks
- (2016) Hanlin Chen et al. JOURNAL OF STATISTICAL PHYSICS
- Trees with large numbers of subtrees
- (2015) Yuzhi Xiao et al. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
- On the Local and Global Means of Subtree Orders
- (2015) Stephan Wagner et al. JOURNAL OF GRAPH THEORY
- Pfaffian orientations and perfect matchings of scale-free networks
- (2015) Zhongzhi Zhang et al. THEORETICAL COMPUTER SCIENCE
- Extremal results on average subtree density of series-reduced trees
- (2014) John Haslegrave JOURNAL OF COMBINATORIAL THEORY SERIES B
- Degree-ordered percolation on a hierarchical scale-free network
- (2014) Hyun Keun Lee et al. PHYSICAL REVIEW E
- The Minimal Number of Subtrees of a Tree
- (2013) Andrew V. Sills et al. GRAPHS AND COMBINATORICS
- The Minimal Number of Subtrees with a Given Degree Sequence
- (2013) Xiu-Mei Zhang et al. GRAPHS AND COMBINATORICS
- The Number of Subtrees of Trees with Given Degree Sequence
- (2012) Xiu-Mei Zhang et al. JOURNAL OF GRAPH THEORY
- Counting spanning trees in self-similar networks by evaluating determinants
- (2011) Yuan Lin et al. JOURNAL OF MATHEMATICAL PHYSICS
- Spanning trees in a fractal scale-free lattice
- (2011) Zhongzhi Zhang et al. PHYSICAL REVIEW E
- Planar unclustered scale-free graphs as models for technological and biological networks
- (2010) Alicia Miralles et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- (2008) Russell Kirk et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started