The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
From MaRDI portal
Publication:668164
DOI10.1016/j.amc.2015.06.115zbMath1410.05119OpenAlexW896555670MaRDI QIDQ668164
Publication date: 18 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.115
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (8)
The maximum matching energy of bicyclic graphs with even girth ⋮ 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 ⋮ On the k-matchings of the complements of bicyclic graphs ⋮ Extremal values of matching energies of one class of graphs ⋮ Further results on the largest matching root of unicyclic graphs ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs
Cites Work
- Extremality of degree-based graph entropies
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- Unicyclic graphs with large energy
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- On a relation between the Randić index and the chromatic number
- The matching energy of a graph
- The matching energy of graphs with given parameters
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- An introduction to matching polynomials
- The matching energy of random graphs
- Degree distance of unicyclic graphs with given matching number
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- The Maximal Matching Energy of Tricyclic Graphs
- Median eigenvalues of bipartite subcubic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies