Maximally edge-connected graphs and zeroth-order general Randić index for -1
From MaRDI portal
Publication:5963616
DOI10.1007/S10878-014-9728-YzbMATH Open1360.90264OpenAlexW2032154165MaRDI QIDQ5963616FDOQ5963616
Guifu Su, Guojun Li, Liming Xiong, Xiaofeng Su
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9728-y
Recommendations
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs
- Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
Cites Work
- Inverse degree and edge-connectivity
- Diameter and inverse degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Congruent Graphs and the Connectivity of Graphs
- Title not available (Why is that?)
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- Maximally connected digraphs
- Title not available (Why is that?)
- Bipartite graphs and digraphs with maximum connectivity
- Title not available (Why is that?)
- Results on the edge-connectivity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Graph-Theoretic Approach to a Communications Problem
- Title not available (Why is that?)
- On sharp bounds of the zero-order Randić index of certain unicyclic graphs
- Sufficient conditions for maximally connected dense graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number
- The connectivity of large digraphs and graphs
- On graphs with equal edge-connectivity and minimum degree
- A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
Cited In (13)
- Title not available (Why is that?)
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
- Super edge-connectivity and zeroth-order Randić index
- Super-edge-connectivity and zeroth-order Randić index
- The zeroth-order general Randic index of graphs with a given clique number
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Title not available (Why is that?)
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
- Maximally and super connected multisplit graphs and digraphs
- Maximal value of the zeroth-order Randić index
- On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree
- Zeroth-order general Randić index of cactus graphs
- Beyond the Zagreb indices
Uses Software
This page was built for publication: Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963616)
