On the matching polynomial of subdivision graphs

DOI10.1016/J.DAM.2008.05.005MaRDI QIDQ1003776zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Hosoya indexmatching generating functionmatching polynomialsubdivision

Mathematics Subject Classification ID

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

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

Cites work

• An introduction to matching polynomials
• Connections between Wiener index and matchings
• scientific article; zbMATH DE number 4051682 (Why is no real title available?)
• Matching polynomials and duality
• Matching polynomials of two classes of graphs
• Matching theory
• 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
• On the ordering of graphs with respect to their matching numbers
• The matching polynomial of a distance-regular graph

Cited in

(17)

• The number of spanning trees of a family of 2-separable weighted graphs
• 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
• Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
• The average Laplacian polynomial of a graph
• Using edge generating function to solve monomer-dimer problem
• A fast numerical method for fractional partial integro-differential equations with spatial-time delays
• Topological indices of the line graph of subdivision graphs and their Schur-bounds
• Using Edge-Induced and Vertex-Induced Subhypergraph Polynomials
• Subdivision of edges and matching size.
• Note on the subgraph component polynomial
• Matching polynomials for some nanostar dendrimers
• A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
• MMD labeling of EASS of Jewel graph
• Exploring modular multiplicative divisor labeling to expand graph families
• On integral variations for roots of the Laplacian matching polynomial of graphs
• Subdivision method in the Laplacian matching polynomial

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)