The matching polynomial of the path-tree of a complete graph

DOI10.1016/J.DAM.2024.08.005MaRDI QIDQ6633540

Haiyan Chen, Mingxu Guo

Publication date: 6 November 2024

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

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The matching energy of a graph
• Applications of recurrence relations for the characteristic polynomials of Bethe trees
• An introduction to matching polynomials
• Problems in algebraic combinatorics
• A complete solution to a conjecture on the \({\beta}\)-polynomials of graphs
• On eigenvalues and the energy of dendrimer trees
• An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
• Theory of monomer-dimer systems
• Graph Energy
• On the theory of the matching polynomial
• Matchings and walks in graphs
• Spectra of graphs. Theory and application

This page was built for publication: The matching polynomial of the path-tree of a complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633540)