Super restricted edge connected Cartesian product graphs (Q989444): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018475291 / 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: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-connected and super-arc-connected Cartesian product of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On super edge-connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On super connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super restricted edge connectivity of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Given Group and Given Graph-Theoretical Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge- and point-connectivities of the Cartesian product of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super restricted edge-connectivity of vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for graphs to be <i>λ′</i>‐optimal and super‐<i>λ′</i> / rank
 
Normal rank

Latest revision as of 03:20, 3 July 2024

scientific article
Language Label Description Also known as
English
Super restricted edge connected Cartesian product graphs
scientific article

    Statements

    Super restricted edge connected Cartesian product graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    restricted edge cut
    0 references
    restricted edge connectivity
    0 references
    Cartesian product
    0 references
    \(\lambda'\)-optimal
    0 references
    super-\(\lambda'\)
    0 references
    combinatorial problems
    0 references
    0 references