Diameter-sufficient conditions for a graph to be super-restricted connected (Q1005222): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Camino Balbuena / rank
 
Normal rank
Property / author
 
Property / author: Yu-qing Lin / 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.2007.11.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121182408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order and size of \(s\)-geodetic digraphs with given connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the restricted connectivity and superconnectivity in graphs with given girth / 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: Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i> / 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: 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: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional connectivity / 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: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / 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: Q5463565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466060 / 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: Q2704926 / 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: Super connectivity of line graphs / 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
Property / cites work
 
Property / cites work: On optimally-\(\lambda^{(3)}\) transitive graphs / rank
 
Normal rank

Latest revision as of 03:46, 29 June 2024

scientific article
Language Label Description Also known as
English
Diameter-sufficient conditions for a graph to be super-restricted connected
scientific article

    Statements

    Diameter-sufficient conditions for a graph to be super-restricted connected (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2009
    0 references
    0 references
    diameter
    0 references
    girth
    0 references
    restricted connectivity
    0 references
    0 references