arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.09701cs.SIcs.DM
收藏

成对阈值图

Paired Threshold Graphs

Vida Ravanmehr, Gregory J. Puleo, Sadegh Bolouki, Olgica Milenkovic

摘要:

阈值图是递归确定性网络模型,已被提出用于描述某些经济和社会相互作用。这个图族的一个缺点是它具有有限的生成附件规则。为了缓解这个问题,我们引入了一类新的图,称为配对阈值(PT)图描述通过顶点权重,通过两个不等式管理边的存在。一个不等式施加了相邻顶点的权重之和必须超过指定阈值的约束。第二个不等式确保相邻顶点具有由另一个阈值限定的权重差上限。我们提供了一个概念上简单的PT图的特征和分解,分析其禁止的诱导子图,并提出了一种方法进行PT图,满足定义的约束条件的顶点权重分配。此外,我们描述了一个多项式时间算法识别PT图。最后对PT图的交数、直径和聚类系数进行了分析。

英文摘要:

Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate this problem, we introduce a new class of graphs termed Paired Threshold (PT) graphs described through vertex weights that govern the existence of edges via two inequalities. One inequality imposes the constraint that the sum of weights of adjacent vertices has to exceed a specified threshold. The second inequality ensures that adjacent vertices have a weight difference upper bounded by another threshold. We provide a conceptually simple characterization and decomposition of PT graphs, analyze their forbidden induced subgraphs and present a method for performing vertex weight assignments on PT graphs that satisfy the defining constraints. Furthermore, we describe a polynomial-time algorithm for recognizing PT graphs. We conclude our exposition with an analysis of the intersection number, diameter and clustering coefficient of PT graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑