Evaluation method for node importance in communication networks
An evaluation method for node importance in communication networks is proposed, the concise generalized expressions are given. The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees. The most vital nodes are those whose removal with t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2004-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74360268/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539116630540288 |
|---|---|
| author | CHEN Yong HU Ai-qun HU Xiao |
| author_facet | CHEN Yong HU Ai-qun HU Xiao |
| author_sort | CHEN Yong |
| collection | DOAJ |
| description | An evaluation method for node importance in communication networks is proposed, the concise generalized expressions are given. The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees. The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees. Experimental results show that the method is simple and can reflect node importance determined by the network topology more precisely. |
| format | Article |
| id | doaj-art-83a4f68650464e8c88e96b7bb0827135 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2004-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-83a4f68650464e8c88e96b7bb08271352025-01-14T07:26:44ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2004-01-0112913474360268Evaluation method for node importance in communication networksCHEN YongHU Ai-qunHU XiaoAn evaluation method for node importance in communication networks is proposed, the concise generalized expressions are given. The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees. The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees. Experimental results show that the method is simple and can reflect node importance determined by the network topology more precisely.http://www.joconline.com.cn/zh/article/74360268/communication networksreliabilitynodespanning tree |
| spellingShingle | CHEN Yong HU Ai-qun HU Xiao Evaluation method for node importance in communication networks Tongxin xuebao communication networks reliability node spanning tree |
| title | Evaluation method for node importance in communication networks |
| title_full | Evaluation method for node importance in communication networks |
| title_fullStr | Evaluation method for node importance in communication networks |
| title_full_unstemmed | Evaluation method for node importance in communication networks |
| title_short | Evaluation method for node importance in communication networks |
| title_sort | evaluation method for node importance in communication networks |
| topic | communication networks reliability node spanning tree |
| url | http://www.joconline.com.cn/zh/article/74360268/ |
| work_keys_str_mv | AT chenyong evaluationmethodfornodeimportanceincommunicationnetworks AT huaiqun evaluationmethodfornodeimportanceincommunicationnetworks AT huxiao evaluationmethodfornodeimportanceincommunicationnetworks |