On the matching polynomial of subdivision graphs

DOI10.1016/J.DAM.2008.05.005zbMATH Open1204.05083OpenAlexW2064507540MaRDI QIDQ1003776FDOQ1003776

Authors: 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

Recommendations

• On the Kirchhoff index of a graph and the matchings of the subdivision
• Subdivision of edges and matching size.
• A new expression for matching polynomials
• On the matching polynomial of theta graphs.
• Polynomials and Hosoya index of graphs

zbMATH Keywords

matching polynomialsubdivisionHosoya indexmatching generating function

Mathematics Subject Classification ID

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

Cites Work

• Matching theory
• Connections between Wiener index and matchings
• An introduction to matching polynomials
• On the ordering of graphs with respect to their matching numbers
• Title not available (Why is that?)
• Matching polynomials and duality
• On the maximal energy and the Hosoya index of a type of trees with many pendant vertices
• On the minimal energy of trees with a given diameter
• On the number of matchings of graphs formed by a graph operation
• Matching polynomials of two classes of graphs
• The matching polynomial of a distance-regular graph

Cited In (14)

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

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

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