The bipartite unicyclic graphs with the first n - 34 largest matching energies
From MaRDI portal
Publication:668164
Recommendations
Cites work
- A congruence relation for the Wiener index of graphs with a tree-like structure
- A short note on graph energy
- A survey on graphs extremal with respect to distance-based topological indices
- An exceptional property of first Zagreb index
- An introduction to matching polynomials
- Benzenoid systems with extremal vertex-degree-based topological indices
- Complete solution to a conjecture on the fourth maximal energy tree
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Computing Szeged index of certain nanosheets using partition technique
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Counterexamples to a conjecture on Wiener index of common neighborhood graphs
- Degree distance of unicyclic graphs with given matching number
- Estimating the incidence energy
- Extremal matching energy of bicyclic graphs
- Extremal Wiener index of trees with given number of vertices of even degree
- Extremality of degree-based graph entropies
- Further properties of the second Zagreb index
- Graph energy
- Graph theory
- Graphs with extremal matching energies and prescribed parameters
- Harary index of some nano-structures
- scientific article; zbMATH DE number 6704589 (Why is no real title available?)
- scientific article; zbMATH DE number 6704610 (Why is no real title available?)
- scientific article; zbMATH DE number 6704634 (Why is no real title available?)
- scientific article; zbMATH DE number 6704637 (Why is no real title available?)
- scientific article; zbMATH DE number 6704641 (Why is no real title available?)
- scientific article; zbMATH DE number 3679880 (Why is no real title available?)
- scientific article; zbMATH DE number 3893246 (Why is no real title available?)
- scientific article; zbMATH DE number 6282144 (Why is no real title available?)
- scientific article; zbMATH DE number 6282177 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- Hypoenergetic trees
- Maximal matching energy of tricyclic graphs
- Maximizing the Zagreb indices of (n,m)-graphs
- Median eigenvalues of bipartite planar graphs
- Note on the HOMO-LUMO index of graphs
- On a conjecture about tricyclic graphs with maximal energy
- On a relation between the Randić index and the chromatic number
- On connective eccentricity index of graphs
- On incidence energy
- On Laplacian energy
- On minimum matching energy of graphs
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On segments, vertices of degree two and the first Zagreb index of trees
- On the Wiener index of trees with given number of branching vertices
- On Wiener index of common neighborhood graphs
- Sharp upper bounds for the Balaban index of bicyclic graphs
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- The matching energy of a graph
- The matching energy of graphs with given parameters
- The matching energy of random graphs
- The minimal matching energy of (n,m)-graphs with a given matching number
- The second Zagreb index of molecular graphs with tree structure
- The Wiener polarity index of graph products.
- Trees of given order and independence number with minimal first Zagreb index
- Unicyclic graphs with large energy
- Vertex version of the Wiener theorem
Cited in
(10)- Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth
- On the minimal matching energies of unicyclic graphs
- On ordering of complements of graphs with respect to matching numbers
- Extremal matching energy and the largest matching root of complete multipartite graphs
- The maximum matching energy of bicyclic graphs with even girth
- On the k-matchings of the complements of bicyclic graphs
- Further results on the largest matching root of unicyclic graphs
- Bounds on the matching energy of unicyclic odd-cycle graphs
- Extremal values of matching energies of one class of graphs
- The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
This page was built for publication: The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668164)
