On optimizing edge connectivity of product graphs (Q626866): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NISPOC / rank
 
Normal rank
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.disc.2010.12.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087991374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter / 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: Edge fault tolerance analysis of super \(k\)-restricted connected networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decomposition of lexicographic product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems in the analysis and design of probabilistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Line-Connectivity Properties of Circulant Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of the product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of the product of two 4-chromatic graphs is 4 / 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: Stable networks and product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Factorable Extensions and Subgraphs of Prime Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, Fractional Domination, 2-Packing, and Graph Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally restricted edge connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On products of graphs and regular groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge connectivity properties of connected edge symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super \(p\)-restricted edge connectivity of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a product dimension of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a kind of restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Automorphism Group of a Product of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / 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: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / 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: Independence numbers of product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number of the strong product of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-restricted edge connectivity for some interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic reliability analysis for the Boolean n cube networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2931463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5320327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:37, 3 July 2024

scientific article
Language Label Description Also known as
English
On optimizing edge connectivity of product graphs
scientific article

    Statements

    On optimizing edge connectivity of product graphs (English)
    0 references
    0 references
    18 February 2011
    0 references
    Cartesian product
    0 references
    direct product
    0 references
    strong product
    0 references
    lexicographic product
    0 references
    edge connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers