Matching Energy of Graphs with Maximum Degree at Most 3
From MaRDI portal
Recommendations
Cites work
- A lower bound for graph energy in terms of minimum and maximum degrees
- Algebraic matching theory
- An introduction to matching polynomials
- Graph energy
- Graphs with extremal matching energies and prescribed parameters
- Graphs with integer matching polynomial zeros
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3679880 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- Lower bounds on matching energy of graphs
- Non-hypoenergetic graphs with nullity 2
- On minimum matching energy of graphs
- On the theory of the matching polynomial
- The matching energy of a graph
- The matching energy of graphs with given parameters
- Theory of monomer-dimer systems
Cited in
(6)- Lower bounds on matching energy of graphs
- scientific article; zbMATH DE number 6532270 (Why is no real title available?)
- The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
- The matching energy of a graph
- The matching energy of graphs with given parameters
- The matching energy of graphs with given edge connectivity
This page was built for publication: Matching Energy of Graphs with Maximum Degree at Most 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047129)