scientific article; zbMATH DE number 7410264

MaRDI QIDQ5156345zbMATH OpenFDO

Authors Hanlin Chen, Renfang Wu, Hanyuan Deng

Publication date 15 October 2021

Full work available at URL https://match.pmf.kg.ac.rs/electronic_versions/Match78/n1/match78n1_103-120.pdf

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Recommendations

• Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
• The extremal values of some topological indices in bipartite graphs with a given matching number
• The extremal graphs of some topological indices with given vertex \(k\)-partiteness
• Extremal values of vertex-degree-based topological indices over graphs
• Extremal topological indices for graphs of given connectivity
• On the monotonicity of topological indices and the connectivity of a graph
• scientific article; zbMATH DE number 6940853
• Extremal \((n,m)\)-graphs with respect to distance-degree-based topological indices
• Extremal graphs with respect to two distance-based topological indices
• Extremal problems on exponential vertex-degree-based topological indices

Cited in

(15)

• The extremal graphs of some topological indices with given vertex \(k\)-partiteness
• scientific article; zbMATH DE number 7410900 (Why is no real title available?)
• On the monotonicity of topological indices and the connectivity of a graph
• Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
• On maximum Zagreb indices of bipartite graphs with a given connectivity
• The inverse sum indeg index of graphs with some given parameters
• On the ordering of distance-based invariants of graphs
• The extremal values of some topological indices in bipartite graphs with a given matching number
• Ordering chemical graphs by Randić and sum-connectivity numbers
• Further results on monotonic graph invariants and bipartiteness number
• New formulae for the bipartite vertex frustration and decycling number of graphs
• On extremal bipartite graphs with a given connectivity
• Extremal bipartite graphs of given connectivity with respect to matching energy
• Extremal results and bounds for atom-bond sum-connectivity index
• On extremal bipartite graphs with given number of cut edges

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156345)