
Abstract We consider the squares of intersection graphs of hypergraphs and simple graphs. The Berge-type characterization for squares of intersection graphs of hypergraphs is obtained. The analogue of Whitney theorem for squares of intersection graphs of trees is proved. Using the connection between induced matchings of graph and independent sets of square of line graph, new polynomial solvable cases for the weighted induced matching problem are obtained.
| selected citations These citations are derived from selected sources. 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 |
