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.05194MaRDI 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
05C90: Applications of graph theory
05C12: Distance in graphs
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Related Items
On min–max distance degree index, Unnamed Item, Unnamed Item, Unnamed Item, Comparison between Szeged indices of graphs, On the transmission-based graph topological indices, Comparing Wiener, Szeged and revised Szeged index on cactus graphs, 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 further relation between the (revised) Szeged index and the Wiener index of graphs, 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, Tricyclic graphs with maximal revised Szeged index, On the first geometric-arithmetic index of graphs, On the revised Szeged index, 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, Distribution of some graph invariants over hierarchical product of graphs, Hamilton cycles in graph bundles over a cycle with tree as a fibre, 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 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, Wiener index versus Szeged index in networks, Further results on hierarchical product of graphs, The many facets of the Estrada indices of graphs and networks, Network bipartitioning in the anti-communicability Euclidean space, On the revised Szeged index of unicyclic graphs with given diameter, Comparison between the Szeged index and the eccentric connectivity index, Network bipartivity and the transportation efficiency of European passenger airlines, On extremal cacti with respect to the revised Szeged index, 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, Bicyclic graphs with maximal revised Szeged index, The \(k\)-Szeged index of graphs, Topological characterization of statistically clustered networks for molecular similarity analysis
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
