Name
Abstract | ||
|---|---|---|
Let G and H be connected graphs and let G ∗ H be the strong product of G by H . We show that every retract R of G ∗ H is of the form R=G′∗H′ , where G ′ is a subgraph of G and H ′ one of H . For triangle-free graphs G and H both G ′ and H ′ are retracts of G and H , respectively. Furthermore, a product of finitely many finite, triangle-free graphs is retract-rigid if and only if all factors are retract-rigid and it is rigid if and only if all factors are rigid and pairwise non-isomorphic. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90285-N | Discrete Mathematics |
Keywords | Field | DocType |
strong product | Discrete mathematics,Graph,Combinatorics,Retract,Of the form,Graph product,If and only if,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
109 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.97 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Imrich | 1 | 64 | 20.65 |
| S. Klavžar | 2 | 41 | 4.94 |