首页    期刊浏览 2024年11月25日 星期一
登录注册

文章基本信息

  • 标题:Optimization Problems on Threshold Graphs
  • 本地全文:下载
  • 作者:Mihai Talmaciu ; Elena Nechita
  • 期刊名称:Brain. Broad Research in Artificial Intelligence and Neuroscience
  • 印刷版ISSN:2067-3957
  • 出版年度:2010
  • 卷号:1
  • 页码:61-68
  • 语种:English
  • 出版社:EduSoft publishing
  • 摘要:During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
  • 关键词:Threshold graph, weakly decomposition, Wiener index, Wiener polynomial
国家哲学社会科学文献中心版权所有