Lower bounds on matching energy of graphs
From MaRDI portal
Publication:2057601
DOI10.1016/J.DAM.2021.10.018zbMath1479.05203OpenAlexW3213991590MaRDI QIDQ2057601
Publication date: 7 December 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.10.018
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with few matching roots
- Graphs with integer matching polynomial zeros
- Factors and factorizations of graphs. Proof techniques in factor theory
- The matching energy of a graph
- The matching energy of graphs with given parameters
- Bounds on the largest root of the matching polynomial
- An introduction to matching polynomials
- Problems in algebraic combinatorics
- Algebraic matching theory
- Theory of monomer-dimer systems
- Graph Energy
- On the theory of the matching polynomial
- The Factors of Graphs
- Maximal energy graphs
This page was built for publication: Lower bounds on matching energy of graphs