On the number of matchings of graphs formed by a graph operation
DOI10.1007/S11425-006-2014-4zbMATH Open1110.05085OpenAlexW1491717838MaRDI QIDQ867792FDOQ867792
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- Enumeration of perfect matchings in graphs with reflective symmetry
- Homogeneous multivariate polynomials with the half-plane property
- Title not available (Why is that?)
- Extremal hexagonal chains concerning largest eigenvalue
- 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 acyclic systems with minimal Hosoya index
- The number of matchings of low order in hexagonal systems
- A note on the number of matchings and independent sets in trees
- Title not available (Why is that?)
Cited In (13)
- An infinite family of graphs with a facile count of perfect matchings
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- Monomer-dimer problem on some networks
- On the monomer-dimer problem of some graphs
- The relationship between the eccentric connectivity index and Zagreb indices
- Using edge generating function to solve monomer-dimer problem
- Title not available (Why is that?)
- ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
- The number of spanning trees of a family of 2-separable weighted graphs
- On the matching polynomial of subdivision graphs
- A note on generalized semitotal point graphs
- THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH
- Study of dimer-monomer on the generalized Hanoi graph
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)
