Show simple item record

dc.contributor.author王艳
dc.contributor.author钱建国
dc.date.accessioned2017-11-14T02:51:22Z
dc.date.available2017-11-14T02:51:22Z
dc.date.issued2002-12-30
dc.identifier.citation数学研究,2002,(04):36-41
dc.identifier.issn1006-6837
dc.identifier.otherSSYJ200204004
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/154925
dc.description.abstract一个图的线团图就是这个图的线图的团图 .对于自然数 n,一个图被称为 n-线团 -收敛的 ,如果它的 n次线团图同构于一个固定的图 .否则称之为发散的 .本文刻画了线团 -收敛图与发散图 ,给出一个线团 -收敛图的构造方法 .并且 ,讨论了线团 -收敛图的线团 -收敛指数 .
dc.description.abstractThe line clique graph, KL(G) , of a graph G is the intersection graph of the cliques of the line graph L(G) of G. For a natural number n, a graph G is n KL convergent if the n th iterated line clique graph KL n(G) is isomorphic to a fixed graph G′. A graph G is KL convergent if there is a natural number n such that G is n KL convergent. Otherwise G is divergent. In this paper, KL convergent graphs and divergent graphs are characterized. A method for constructing any KL convergent graph from a graph triangle free is provided. We also discuss the KL convergent index of KL convergent graphs.
dc.language.isozh_CN
dc.subject线团图
dc.subject线团-收敛
dc.subject线团-收敛指数
dc.subjectline clique graph
dc.subjectKL convergent
dc.subjectKL convergent index
dc.title线团 -收敛图(英文)
dc.title.alternativeOn KL-convergent graphs
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record