Inverse degree and edge-connectivity
From MaRDI portal
Publication:1043655
DOI10.1016/j.disc.2008.06.041zbMath1203.05082OpenAlexW2009473332MaRDI QIDQ1043655
Lutz Volkmann, Angelika Hellwig, Peter Dankelmann
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.041
Related Items (26)
Inverse degree, Randic index and harmonic index of graphs ⋮ Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ On the edge-connectivity of C_4-free graphs ⋮ Computational and analytical studies of the Randić index in Erdős-Rényi models ⋮ Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ Applications of the inverse degree index to molecular structures ⋮ Inverse degree index: exponential extension and applications ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index ⋮ Inverse degree and super edge-connectivity ⋮ Maximally edge-connected hypergraphs ⋮ Beyond the Zagreb indices ⋮ Inequalities on the inverse degree index ⋮ On diameter and inverse degree of a graph ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ 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 \(\alpha\leq-1\) ⋮ Edge-connectivity in hypergraphs ⋮ Unnamed Item ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected ⋮ More on inverse degree and topological indices of graphs ⋮ New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs ⋮ Relations between ordinary and multiplicative degree-based topological indices ⋮ Zagreb indices of graphs ⋮ Some extremal graphs with respect to inverse degree
Uses Software
Cites Work
- A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
- Results on the edge-connectivity of graphs
- Diameter and inverse degree
- A sufficient condition for equality of edge-connectivity and minimum degree of a graph
- On super-edge-connected digraphs and bipartite digraphs
- A Graph-Theoretic Approach to a Communications Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inverse degree and edge-connectivity
