On the 3-restricted edge connectivity of permutation graphs (Q1028132): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2008.04.010 / rank
Normal rank
 
Property / author
 
Property / author: Diego González-Moreno / rank
Normal rank
 
Property / author
 
Property / author: Xavier Marcote / rank
Normal rank
 
Property / author
 
Property / author: Diego González-Moreno / rank
 
Normal rank
Property / author
 
Property / author: Xavier Marcote / 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.dam.2008.04.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980185895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large minimum degree and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted connectivities of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability of interconnection networks modeled by a product of graphs / 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: Diameter-girth sufficient conditions for optimal extraconnectivity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large graphs with given degree and diameter. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulants and their connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / 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: Extraconnectivity of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extraconnectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490015 / 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: Conditional connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large survivable nets and the generalized prisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge cuts leaving components of order at least \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3834076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of generalized prisms over G / 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: On restricted edge-connectivity of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2008.04.010 / rank
 
Normal rank

Latest revision as of 13:43, 10 December 2024

scientific article
Language Label Description Also known as
English
On the 3-restricted edge connectivity of permutation graphs
scientific article

    Statements

    On the 3-restricted edge connectivity of permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    connectivity
    0 references
    permutation graph
    0 references
    super \(k\)-restricted edge connectivity
    0 references
    \(k\)-edge degree
    0 references
    perfect matching
    0 references

    Identifiers