Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets
Publication:2385379
DOI10.1007/s10910-005-9039-8zbMath1186.05075OpenAlexW2002880160MaRDI QIDQ2385379
Publication date: 12 October 2007
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-005-9039-8
square latticepolyomino chaingraph invariantk-matchingk-independent settotal \(\pi\)-electron energyy-polynomialz-polynomial
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular physics (81V55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ordering of graphs with respect to their matching numbers
- An introduction to matching polynomials
- On acyclic conjugated molecules with minimal energies
- Several constants arising in statistical mechanics
- Polygonal chains with minimal energy
- On minimal energy ordering of acyclic conjugated molecules
- The Number of Independent Sets in a Grid Graph
- Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets
- Matchings in starlike trees
This page was built for publication: Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets