On the matching polynomial of subdivision graphs

DOI10.1016/j.dam.2008.05.005zbMath1204.05083OpenAlexW2064507540MaRDI QIDQ1003776

Weigen Yan, Yeong-Nan Yeh

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.005

zbMATH Keywords

subdivisionmatching polynomialHosoya indexmatching generating function

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

Topological indices of the line graph of subdivision graphs and their Schur-bounds ⋮ Note on the subgraph component polynomial ⋮ The average Laplacian polynomial of a graph ⋮ MMD labeling of EASS of Jewel graph ⋮ Using edge generating function to solve monomer-dimer problem ⋮ A fast numerical method for fractional partial integro-differential equations with spatial-time delays ⋮ A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types ⋮ The number of spanning trees of a family of 2-separable weighted graphs ⋮ On the location of zeros of the Laplacian matching polynomials of graphs ⋮ Matching polynomials for some nanostar dendrimers ⋮ Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching polynomials and duality
• Matching polynomials of two classes of graphs
• On the minimal energy of trees with a given diameter
• On the number of matchings of graphs formed by a graph operation
• Matching theory
• On the ordering of graphs with respect to their matching numbers
• An introduction to matching polynomials
• The matching polynomial of a distance-regular graph
• Connections between Wiener index and matchings

This page was built for publication: On the matching polynomial of subdivision graphs