274
个编辑
更改
→Maximum Matching
While sparser graphs are more difficult to control, it would obviously be interesting to find whether betweenness centrality and closeness centrality or degree heterogeneity plays a more important role in deciding controllability of sparse graphs with almost similar degree distributions.
While sparser graphs are more difficult to control, it would obviously be interesting to find whether betweenness centrality and closeness centrality or degree heterogeneity plays a more important role in deciding controllability of sparse graphs with almost similar degree distributions.
虽然'''<font color="#FF8000">稀疏图 Sparser Graph </font>'''更难以控制，但发现中介中心性和紧密度中心性或'''<font color="#FF8000">度异质性 Degree Heterogeneity </font>'''在决定具有几乎相似度分布的稀疏图的可控性中是否起更重要的作用显然是有趣的。
==Control of composite quantum systems and algebraic graph theory==
==Control of composite quantum systems and algebraic graph theory==