Recommendations
Cited in
(61)- Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
- Degree-based entropies of networks revisited
- Inertia of complex unit gain graphs
- Further results on digraphs with completely real Laplacian spectra
- Bounds for degree-based network entropies
- Note on two generalizations of the Randić index
- Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)
- Extremal bipartite graphs of given connectivity with respect to matching energy
- On the minimal matching energies of unicyclic graphs
- A lower bound of revised Szeged index of bicyclic graphs
- Two classes of topological indices of phenylene molecule graphs
- On the Sombor characteristic polynomial and Sombor energy of a graph
- Matchings in graphs with a given number of cuts
- Extremal graphs with respect to matching energy for random six-membered ring spiro chains
- Extremal matching energy and the largest matching root of complete multipartite graphs
- Maximum Detour-Harary index for some graph classes
- The matching energy of random graphs
- The augmented Zagreb indices of fluoranthene-type benzenoid systems
- The maximum matching energy of bicyclic graphs with even girth
- Graphs with extremal matching energies and prescribed parameters
- The minimum matching energy of bicyclic graphs with given girth
- Extremal matching energy of molecular graphs with given matching number two
- On the k-matchings of the complements of bicyclic graphs
- On eigenvalues of the reciprocal distance signless Laplacian matrix of graphs
- Effect of clustering on attack vulnerability of interdependent scale-free networks
- Ordering of bicyclic graphs by matching energy
- scientific article; zbMATH DE number 7410909 (Why is no real title available?)
- Minimum matching energy of tricyclic graphs
- The extremal graphs with respect to the matching energy in starlike trees
- Extremal graph with respect to matching energy for a random polyphenyl chain
- Bounds on the matching energy of unicyclic odd-cycle graphs
- The extremal matching energy of graphs.
- Matchings in bipartite graphs with a given number of cuts
- Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
- On the tree with diameter 4 and maximal energy
- On the general trigonometric sums weighted by character sums
- Finding a shortest cycle in a subspace of the cycle space of a graph
- Second order Randić index of fluoranthene-type benzenoid systems
- The reformulated Zagreb indices of tricyclic graphs
- On a problem analogues to Lehmer's and Hurwitz zeta-function
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The unicyclic graphs with maximum degree resistance distance
- Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs
- Extremal Laplacian energy of threshold graphs
- On energy and Laplacian energy of bipartite graphs
- The general connectivity indices of fluoranthene-type benzenoid systems
- Extremal values of matching energies of one class of graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- Randić energy of specific graphs
- Graph distance measures based on topological indices revisited
- The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees
- On Laplacian energy in terms of graph invariants
- A unified approach to the asymptotic topological indices of various lattices
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
- Bicyclic oriented graphs with skew-rank 6
- Bicyclic digraphs with maximal energy
- The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
- Bipartite cacti with extremal matching energy
- The matching energy of a graph
- Extremal matching energy of complements of trees
- The matching energy of graphs with given edge connectivity
This page was built for publication: Extremal matching energy of bicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408316)
