
AbstractLet n∈N. We describe a list Gn of graphs such that if the nth power Gn of a graph G contains a claw then some graph in Gn appears as an induced subgraph of G. We show that our set Gn is the smallest set of graphs with this property. If T is a tree, this gives a precise characterization of the claw-free powers of T.
Clawfreeness, Graph power, Claw-free, Applied Mathematics, Discrete Mathematics and Combinatorics
Clawfreeness, Graph power, Claw-free, Applied Mathematics, Discrete Mathematics and Combinatorics
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
