Further results on monotonic graph invariants and bipartiteness number
From MaRDI portal
(Redirected from Publication:5742570)
Recommendations
- scientific article; zbMATH DE number 7410264
- Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
- On extremal bipartite graphs with given number of cut edges
- Extremal graphs with bounded vertex bipartiteness number
- The extremal values of some topological indices in bipartite graphs with a given matching number
Cites work
- A proof of a conjecture on the Estrada index
- A survey on the Laplacian-energy-like invariant
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Coulson-type integral formulas for the general Laplacian energy-like invariant of graphs. II.
- Coulson-type integral formulas for the general Laplacian-energy-like invariant of graphs. I.
- Extremal graphs with bounded vertex bipartiteness number
- Graphs with maximum Laplacian and signless Laplacian Estrada index
- Graphs with maximum Laplacian-energy-like invariant and incidence energy
- scientific article; zbMATH DE number 3679880 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 7410264 (Why is no real title available?)
- scientific article; zbMATH DE number 6256254 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Multiplicative versions of first Zagreb index
- On maximum Estrada indices of bipartite graphs with some given parameters
- On sum of powers of the Laplacian eigenvalues of graphs
- On the Laplacian energy of a graph
- On the monotonicity of topological indices and the connectivity of a graph
- Spectra of graphs obtained by a generalization of the join graph operation
- The extremal values of some topological indices in bipartite graphs with a given matching number
- The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
- The matching energy of a graph
This page was built for publication: Further results on monotonic graph invariants and bipartiteness number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5742570)