On the minimal matching energies of unicyclic graphs

DOI10.1016/j.dam.2018.06.013zbMath1404.05123OpenAlexW2809746374MaRDI QIDQ1720335

Jianming Zhu, Ju Yang

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.013

zbMATH Keywords

eigenvaluecharacteristic polynomialmatching energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs, Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy

Cites Work

• The minimum matching energy of bicyclic graphs with given girth
• Minimal energies of trees with given parameters
• Two subgraph grafting theorems on the energy of bipartite graphs
• The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
• Extremal values of matching energies of one class of graphs
• The matching energy of a graph
• The matching energy of graphs with given parameters
• Ordering of the trees by minimal energies
• An introduction to matching polynomials
• The proof of a conjecture on the comparison of the energies of trees
• Graph Energy
• Ordering of bicyclic graphs by matching energy
• The Maximal Matching Energy of Tricyclic Graphs
• The matching energy of graphs with given edge connectivity
• 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