Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs

DOI10.22049/CCO.2016.13514zbMATH Open1365.05114OpenAlexW2323736298MaRDI QIDQ5269917FDOQ5269917

Authors: Lutz Volkmann 

Publication date: 28 June 2017

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_13514_2c29013911bbc87b1dc4be81c6823349.pdf

Recommendations

• Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
• Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
• Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
• Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
• Super edge-connectivity and zeroth-order Randić index

zbMATH Keywords

digraphsedge-connectivitymaximally edge-connected digraphszeroth-order general Randić index

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cited In (8)

• Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
• Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
• Vertex-degree based topological indices of digraphs
• Title not available (Why is that?)
• Maximally and super connected multisplit graphs and digraphs
• Directed Zagreb indices
• On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree
• Beyond the Zagreb indices

This page was built for publication: Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269917)