On the number of matchings of graphs formed by a graph operation
From MaRDI portal
Publication:867792
DOI10.1007/s11425-006-2014-4zbMath1110.05085OpenAlexW1491717838MaRDI QIDQ867792
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items
Monomer-dimer problem on some networks ⋮ An infinite family of graphs with a facile count of perfect matchings ⋮ A note on generalized semitotal point graphs ⋮ Study of dimer-monomer on the generalized Hanoi graph ⋮ THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH ⋮ The relationship between the eccentric connectivity index and Zagreb indices ⋮ Unnamed Item ⋮ Using edge generating function to solve monomer-dimer problem ⋮ Resistance distance-based graph invariants of subdivisions and triangulations of graphs ⋮ On the Monomer–Dimer Problem of Some Graphs ⋮ The number of spanning trees of a family of 2-separable weighted graphs ⋮ On the matching polynomial of subdivision graphs ⋮ ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching polynomials and duality
- On the minimal energy of trees with a given diameter
- Matching theory
- Homogeneous multivariate polynomials with the half-plane property
- The number of matchings of low order in hexagonal systems
- Extremal hexagonal chains concerning largest eigenvalue
- On acyclic systems with minimal Hosoya index
- A note on the number of matchings and independent sets in trees
- Enumeration of perfect matchings in graphs with reflective symmetry
This page was built for publication: On the number of matchings of graphs formed by a graph operation
