Extremal values of matching energies of one class of graphs
From MaRDI portal
Publication:668568
DOI10.1016/J.AMC.2015.10.025zbMATH Open1410.05120OpenAlexW2176619317MaRDI QIDQ668568FDOQ668568
Authors: Lin Chen, Jin-Feng Liu
Publication date: 19 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.10.025
Recommendations
- Extremal matching energy of bicyclic graphs
- Extremal matching energy of molecular graphs with given matching number two
- Maximal matching energy of tricyclic graphs
- Minimum matching energy of tricyclic graphs
- The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision.
Cites Work
- Graph theory
- Graph energy
- Title not available (Why is that?)
- Hypoenergetic trees
- Title not available (Why is that?)
- A survey on graphs extremal with respect to distance-based topological indices
- Title not available (Why is that?)
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- An introduction to matching polynomials
- On a conjecture about tricyclic graphs with maximal energy
- Graphs with extremal matching energies and prescribed parameters
- On Wiener index of common neighborhood graphs
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- Title not available (Why is that?)
- Extremality of degree-based graph entropies
- Title not available (Why is that?)
- The minimal matching energy of \((n,m)\)-graphs with a given matching number
- Maximal matching energy of tricyclic graphs
- Bounds on the matching energy of unicyclic odd-cycle graphs
- Extremal matching energy of bicyclic graphs
- The extremal matching energy of graphs.
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The matching energy of a graph
- The matching energy of graphs with given parameters
- Computing Szeged index of certain nanosheets using partition technique
- Maximizing the Zagreb indices of \((n,m)\)-graphs
- Further properties of the second Zagreb index
- An exceptional property of first Zagreb index
- Trees of given order and independence number with minimal first Zagreb index
- Complete solution to a conjecture on the fourth maximal energy tree
- On Laplacian energy
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- A computational approach to construct a multivariate complete graph invariant
- Note on the HOMO-LUMO index of graphs
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- Title not available (Why is that?)
- On connective eccentricity index of graphs
- Title not available (Why is that?)
- On the minimal energy of trees with a given diameter
- On a relation between the Randić index and the chromatic number
- Minimal energy of unicyclic graphs of a given diameter
- On segments, vertices of degree two and the first Zagreb index of trees
- Title not available (Why is that?)
- On Randić energy
- A note on distance-based graph entropies
- Title not available (Why is that?)
- Harary index of some nano-structures
- Benzenoid systems with extremal vertex-degree-based topological indices
- On incidence energy
- The Wiener polarity index of graph products.
- Sharp upper bounds for the Balaban index of bicyclic graphs
- Estimating the incidence energy
- Minimal energy of bicyclic graphs of a given diameter
Cited In (14)
- Extremal matching energy and the largest matching root of complete multipartite graphs
- On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory
- Extremal matching energy of molecular graphs with given matching number two
- Matchings in graphs with a given number of cuts
- Extremal matching energy of bicyclic graphs
- Title not available (Why is that?)
- Maximal matching energy of tricyclic graphs
- Extremal graph with respect to matching energy for a random polyphenyl chain
- Qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs
- Matchings in bipartite graphs with a given number of cuts
- On construction of upper and lower bounds for the HOMO-LUMO spectral gap
- Extremal bipartite graphs of given connectivity with respect to matching energy
- On the minimal matching energies of unicyclic graphs
- Extremal graphs with respect to matching energy for random six-membered ring spiro chains
This page was built for publication: Extremal values of matching energies of one class of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668568)