Extremal matching energy of complements of trees
From MaRDI portal
Publication:726630
DOI10.7151/dmgt.1869zbMath1339.05329arXiv1411.7458OpenAlexW2963850985MaRDI QIDQ726630
Weigen Yan, Heping Zhang, Tingzeng Wu
Publication date: 13 July 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7458
Trees (05C05) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (3)
The matching energy of graphs with given edge connectivity ⋮ On the k-matchings of the complements of bicyclic graphs ⋮ Two classes of topological indices of phenylene molecule graphs
Cites Work
- The matching energy of a graph
- The matching energy of graphs with given parameters
- Recent results in the theory of graph spectra
- An introduction to matching polynomials
- Graph Energy
- On the theory of the matching polynomial
- The Maximal Matching Energy of Tricyclic Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extremal matching energy of complements of trees
