On the number of matchings of graphs formed by a graph operation

DOI10.1007/S11425-006-2014-4MaRDI QIDQ867792zbMATH OpenOpenAlexFDO

Authors Weigen Yan, Yeong-Nan Yeh

Publication date 16 February 2007

Published in Science in China. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-006-2014-4

zbMATH Keywords

degree sequencematching polynomialHosoya indexskew adjacency matrixoriented incident matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the number of \(k\)-matchings in graphs
• On the number of matchings in regular graphs
• On matchings in graphs
• Counting matchings in graphs
• Matchings in graphs with a given number of cuts
• On matching number, decomposition and representation of well-formed graph
• scientific article; zbMATH DE number 5952364
• scientific article; zbMATH DE number 2151975
• The matching number and Hamiltonicity of graphs
• Number of induced matchings of graphs

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 929718 (Why is no real title available?)
• A note on the number of matchings and independent sets in trees
• Enumeration of perfect matchings in graphs with reflective symmetry
• Extremal hexagonal chains concerning largest eigenvalue
• Homogeneous multivariate polynomials with the half-plane property
• Matching polynomials and duality
• Matching theory
• On acyclic systems with minimal Hosoya index
• 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
• The number of matchings of low order in hexagonal systems

Cited in

(14)

• An infinite family of graphs with a facile count of perfect matchings
• Tutte polynomial of tensor product graph and its applications
• ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
• Study of dimer-monomer on the generalized Hanoi graph
• Monomer-dimer problem on some networks
• The number of spanning trees of a family of 2-separable weighted graphs
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• On the monomer-dimer problem of some graphs
• A note on generalized semitotal point graphs
• The total number of matchings in triangle graph of a connected graph.
• The relationship between the eccentric connectivity index and Zagreb indices
• On the matching polynomial of subdivision graphs
• The Hosoya index of graphs formed by a fractal graph
• Using edge generating function to solve monomer-dimer problem

This page was built for publication: On the number of matchings of graphs formed by a graph operation

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