On super restricted edge connectivity of half vertex transitive graphs (Q1926063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of network reliability computations / 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: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally super-edge-connected transitive 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 Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870157 / 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: Conditional edge connectivity properties, reliability comparisons and transitivity of 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: Q5492623 / rank
 
Normal rank

Latest revision as of 00:09, 6 July 2024

scientific article
Language Label Description Also known as
English
On super restricted edge connectivity of half vertex transitive graphs
scientific article

    Statements

    On super restricted edge connectivity of half vertex transitive graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    connected half vertex transitive graphs
    0 references
    bi-Cayley graphs
    0 references
    restricted edge connectivity
    0 references
    super restricted edge connectivity
    0 references
    super restricted edge connected
    0 references
    superatoms
    0 references
    minimum edge degree
    0 references
    component
    0 references
    minimum edge set
    0 references
    bipartite graph
    0 references
    automorphism group
    0 references

    Identifiers