Connectivity of strong products of graphs (Q1959713): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-010-0919-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963704255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-connectivity and restricted edge-connectivity of a product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted connectivities of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the Shannon capacities of odd cycles. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the edge connectivity of direct products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connectivity of the cartesian product of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance and connectivity measures in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced and isometric embeddings of graphs into the strong product of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local chromatic number and Sperner capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in strong products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian threshold for strong products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinal multiplication of structures with a reflexive relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of generalized prisms over G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bound on the Shannon capacity of \(C_7\) / rank
 
Normal rank

Latest revision as of 06:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Connectivity of strong products of graphs
scientific article

    Statements

    Connectivity of strong products of graphs (English)
    0 references
    0 references
    7 October 2010
    0 references
    The strong product of graphs is one of the three commutative and associative graph products. Let \(S\) be the strong product of two given graphs. The author proves that every minimum separating set in \(S\) is either an \(I\)-set or an \(L\)-set in \(S\). This implies that the minimum separating sets in a strong product of graphs are induced by separating sets of factors. Finally, the definition of an \(I\)-set and an \(L\)-set is generalized for strong products of arbitrary finite number of factors.
    0 references
    connectivity
    0 references
    strong product
    0 references

    Identifiers