复杂网络模型的标记和不变量

2012 International Conference on Systems and Informatics (ICSAI2012) Pub Date : 2012-05-19 DOI:10.1109/ICSAI.2012.6223350

B. Yao, Xiangqian Zhou, Jiajuan Zhang, Xiangen Chen, Xiao-Min Zhang, Jianmin Xie, Ming Yao, Mogang Li

{"title":"复杂网络模型的标记和不变量","authors":"B. Yao, Xiangqian Zhou, Jiajuan Zhang, Xiangen Chen, Xiao-Min Zhang, Jianmin Xie, Ming Yao, Mogang Li","doi":"10.1109/ICSAI.2012.6223350","DOIUrl":null,"url":null,"abstract":"Graph labelings related with communication networks have been extensively investigated because their applications to real problems. Some results on graph labellings are obtained here. Scale-free graphs are coming from scale-free networks a few years ago. We use spanning trees to study some important characteristics of scale-free networks, and obtain some results related with scale-free networks. Furthermore, we provide some connections between invariants of graphs in order to apply graph-theoretical methods to network problems.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Labellings and invariants of models from complex networks\",\"authors\":\"B. Yao, Xiangqian Zhou, Jiajuan Zhang, Xiangen Chen, Xiao-Min Zhang, Jianmin Xie, Ming Yao, Mogang Li\",\"doi\":\"10.1109/ICSAI.2012.6223350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph labelings related with communication networks have been extensively investigated because their applications to real problems. Some results on graph labellings are obtained here. Scale-free graphs are coming from scale-free networks a few years ago. We use spanning trees to study some important characteristics of scale-free networks, and obtain some results related with scale-free networks. Furthermore, we provide some connections between invariants of graphs in order to apply graph-theoretical methods to network problems.\",\"PeriodicalId\":164945,\"journal\":{\"name\":\"2012 International Conference on Systems and Informatics (ICSAI2012)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Systems and Informatics (ICSAI2012)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSAI.2012.6223350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Systems and Informatics (ICSAI2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2012.6223350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

与通信网络相关的图标注由于其在实际问题中的应用而得到了广泛的研究。本文得到了一些关于图标注的结果。无标度图来自于几年前的无标度网络。利用生成树对无标度网络的一些重要特性进行了研究，得到了一些与无标度网络相关的结果。此外，我们还提供了图的不变量之间的一些联系，以便将图理论方法应用于网络问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Labellings and invariants of models from complex networks

Graph labelings related with communication networks have been extensively investigated because their applications to real problems. Some results on graph labellings are obtained here. Scale-free graphs are coming from scale-free networks a few years ago. We use spanning trees to study some important characteristics of scale-free networks, and obtain some results related with scale-free networks. Furthermore, we provide some connections between invariants of graphs in order to apply graph-theoretical methods to network problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 International Conference on Systems and Informatics (ICSAI2012)

自引率

0.00%

发文量