Core-satellite graphs: Clustering, assortativity and spectral properties

详细信息    查看全文

• 作者：Ernesto Estrada^a ; ^{ernesto.estrada@strath.ac.uk} ; Michele Benzi^b ; ^{benzi@mathcs.emory.edu}
• 关键词：05C75 ; 05C50 ; 05C82
• 刊名：Linear Algebra and its Applications
• 出版年：2017
• 出版时间：15 March 2017
• 年：2017
• 卷：517
• 期：Complete
• 页码：30-52
• 全文大小：534 K
• 卷排序：517

文摘

Core–satellite graphs (sometimes referred to as generalized friendship graphs) are an interesting class of graphs that generalize many well known types of graphs. In this paper we show that two popular clustering measures, the average Watts–Strogatz clustering coefficient and the transitivity index, diverge when the graph size increases. We also show that these graphs are disassortative. In addition, we completely describe the spectrum of the adjacency and Laplacian matrices associated with core–satellite graphs. Finally, we introduce the class of generalized core–satellite graphs and analyze their clustering, assortativity, and spectral properties.