Maximally edge-connected graphs and zeroth-order general Randić index for -1
From MaRDI portal
(Redirected from Publication:5963616)
Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
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
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 4208109 (Why is no real title available?)
- scientific article; zbMATH DE number 4108815 (Why is no real title available?)
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- scientific article; zbMATH DE number 1062587 (Why is no real title available?)
- scientific article; zbMATH DE number 2121259 (Why is no real title available?)
- scientific article; zbMATH DE number 822753 (Why is no real title available?)
- scientific article; zbMATH DE number 3297026 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A Graph-Theoretic Approach to a Communications Problem
- A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
- A unified approach to the extremal trees for different indices
- Bipartite graphs and digraphs with maximum connectivity
- Congruent Graphs and the Connectivity of Graphs
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number
- Diameter and inverse degree
- Graph theory with applications
- Inverse degree and edge-connectivity
- Maximally connected digraphs
- On graphs with equal edge-connectivity and minimum degree
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On sharp bounds of the zero-order Randić index of certain unicyclic graphs
- Results on the edge-connectivity of graphs
- Sufficient conditions for maximally connected dense graphs
- The connectivity of large digraphs and graphs
Cited in
(18)- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- Extremal topological indices for graphs of given connectivity
- 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
- On the size of linear r-uniform hypergraphs and sufficient conditions for maximally edge-connected hypergraphs
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
- scientific article; zbMATH DE number 5656417 (Why is no real title available?)
- Sufficient conditions for a graph to be k-edge-Hamiltonian, k-path-coverable, traceable and Hamilton-connected
- Maximally and super connected multisplit graphs and digraphs
- Maximal value of the zeroth-order Randić index
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs
- On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree
- Edge realizability of connected simple graphs
- Zeroth-order general Randić index of cactus graphs
- Beyond the Zagreb indices
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)
