Edge-connectivity of strong products of graphs
Copyright policy )Edge-connectivity of strong products of graphs
The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E(G2)|), λ(G2)(|V (G1)|+2|E(G1)|)}. In addition, we fully describe the structure of possible minimum edge cut sets in strong products of graphs.
- University of Maribor Slovenia
presečna množica, povezanost, mathematics, separating set, graph theory, strong product, graph product, info:eu-repo/classification/udc/519.17, teorija grafov, matematika, connectivity, produkt grafov, krepki produkt
presečna množica, povezanost, mathematics, separating set, graph theory, strong product, graph product, info:eu-repo/classification/udc/519.17, teorija grafov, matematika, connectivity, produkt grafov, krepki produkt
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).18 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.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!