Use of the Szeged index and the revised Szeged index for measuring network bipartivity
From MaRDI portal
Publication:608277
DOI10.1016/j.dam.2010.08.004zbMath1215.05194OpenAlexW2054553230MaRDI QIDQ608277
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.004
Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (39)
Network bipartivity and the transportation efficiency of European passenger airlines ⋮ Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ On the further relation between the (revised) Szeged index and the Wiener index of graphs ⋮ The many facets of the Estrada indices of graphs and networks ⋮ Network bipartitioning in the anti-communicability Euclidean space ⋮ Bicyclic graphs with maximal edge revised Szeged index ⋮ Combinatorics of Petersen graph and its compositions for all irreducible representations for Jahn-Teller, non-rigid molecules and clusters ⋮ Towards objective measures of algorithm performance across instance space ⋮ On the difference between the (revised) Szeged index and the Wiener index of cacti ⋮ Cactus graphs with minimum edge revised Szeged index ⋮ On extremal cacti with respect to the revised Szeged index ⋮ The \(k\)-Szeged index of graphs ⋮ On the revised Szeged index ⋮ On the difference between the revised Szeged index and the Wiener index ⋮ Tricyclic graphs with maximal revised Szeged index ⋮ On minimum revised edge Szeged index of bicyclic graphs ⋮ Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones ⋮ On the first geometric-arithmetic index of graphs ⋮ On min–max distance degree index ⋮ Distribution of some graph invariants over hierarchical product of graphs ⋮ Wiener index versus Szeged index in networks ⋮ Further results on hierarchical product of graphs ⋮ Topological characterization of statistically clustered networks for molecular similarity analysis ⋮ The (revised) Szeged index and the Wiener index of a nonbipartite graph ⋮ Improved bounds on the difference between the Szeged index and the Wiener index of graphs ⋮ Comparison between Szeged indices of graphs ⋮ Bicyclic graphs with maximal revised Szeged index ⋮ On extremal cacti with respect to the Szeged index ⋮ The Szeged index and the Wiener index of partial cubes with applications to chemical graphs ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ On a conjecture about the Szeged index ⋮ Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond ⋮ On the revised Szeged index of unicyclic graphs with given diameter ⋮ Unnamed Item ⋮ On the transmission-based graph topological indices ⋮ Unnamed Item ⋮ Hamilton cycles in graph bundles over a cycle with tree as a fibre ⋮ Unnamed Item ⋮ Comparison between the Szeged index and the eccentric connectivity index
Cites Work
- On structural ordering and branching of acyclic saturated hydrocarbons
- Parallel concepts in graph theory
- Computing the bipartite edge frustration of fullerene graphs
- On the eigenvalues of trees
- Edge-contributions of some topological indices and arboreality of molecular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Use of the Szeged index and the revised Szeged index for measuring network bipartivity
