Graphs having extremal monotonic topological indices with bounded vertex k-partiteness
From MaRDI portal
(Redirected from Publication:1786967)
Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
Abstract: The vertex -partiteness of graph is defined as the fewest number of vertices whose deletion from yields a -partite graph. In this paper, we introduce two concepts: monotonic decreasing topological index and monotonic increasing topological index, and characterize the extremal graphs having the minimum Wiener index, the maximum Harry index, the maximum reciprocal degree distance, the minimum eccentricity distance sum, the minimum adjacent eccentric distance sum index, the maximum connective eccentricity index, the maximum Zagreb indices among graphs with a fixed number of vertices and fixed vertex -partiteness, respectively.
Recommendations
- The extremal graphs of some topological indices with given vertex \(k\)-partiteness
- scientific article; zbMATH DE number 7410264
- On the monotonicity of topological indices and the connectivity of a graph
- Extremal topological indices for graphs of given connectivity
- Extremal graphs with bounded vertex bipartiteness number
- The extremal values of some topological indices in bipartite graphs with a given matching number
- Extremal \((n,m)\)-graphs with respect to distance-degree-based topological indices
- scientific article; zbMATH DE number 6940853
- On the monotonicity of (k;g,h)-graphs
- The upper bound for Kirchhoff index of \(p\)-partite graph
Cites work
- A survey on graphs extremal with respect to distance-based topological indices
- Additively weighted Harary index of some composite graphs
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Extremal graphs with bounded vertex bipartiteness number
- Graph theory with applications
- Graphs with maximum Laplacian and signless Laplacian Estrada index
- Graphs with maximum Laplacian-energy-like invariant and incidence energy
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- On structure-sensitivity of degree-based topological indices
- On the maximal connective eccentricity index of bipartite graphs with some given parameters
- On the reciprocal degree distance of graphs
- On two eccentricity-based topological indices of graphs
- Some extremal results on the connective eccentricity index of graphs
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- The Harary index of a graph
- The eccentric connectivity index of nanotubes and nanotori
Cited in
(4)
This page was built for publication: Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786967)