Extremal matching energy and the largest matching root of complete multipartite graphs
From MaRDI portal
Publication:2325219
DOI10.1155/2019/9728976zbMath1420.05098OpenAlexW2939467152MaRDI QIDQ2325219
Publication date: 9 September 2019
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/9728976
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with few matching roots
- Further results on the largest matching root of unicyclic graphs
- Graphs with integer matching polynomial zeros
- 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
- Laplacian energy of a graph
- Bounds on the largest root of the matching polynomial
- An introduction to matching polynomials
- Extremal values of energy over oriented bicyclic graphs
- Graphs with six distinct matching roots
- Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
- The matching energy of random graphs
- On Randić energy
- The largest matching root of unicyclic graphs
- Theory of monomer-dimer systems
- Graph Energy
- On spectral radius and energy of complete multipartite graphs
- On the theory of the matching polynomial
- Graph Classes: A Survey
- The Maximal Matching Energy of Tricyclic Graphs
- The matching energy of graphs with given edge connectivity
This page was built for publication: Extremal matching energy and the largest matching root of complete multipartite graphs