Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) (Q2440121): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Approach to a Communications Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse degree and edge-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and inverse degree / 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: Q3832606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite graphs and digraphs with maximum connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of large digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal edge-connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sharp bounds of the zero-order Randić index of certain unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3356329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for maximally connected dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for equality of arc-connectivity and minimum degree of a digraph / rank
 
Normal rank

Latest revision as of 12:13, 7 July 2024

scientific article
Language Label Description Also known as
English
Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
scientific article

    Statements

    Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2014
    0 references
    vertex degree
    0 references
    zeroth-order general Randić index
    0 references
    edge-connectivity
    0 references
    maximally edge-connected
    0 references

    Identifiers