The Merrifield–Simmons Conjecture Holds for Bipartite Graphs

DOI10.1002/JGT.21656zbMath1261.05081arXiv1006.4253OpenAlexW3123287700WikidataQ123243155 ScholiaQ123243155MaRDI QIDQ4916104

Martin Trinks

Publication date: 19 April 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.4253

zbMATH Keywords

independent setsMerrifield-Simmons conjecture

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

A survey on recurrence relations for the independence polynomial of hypergraphs ⋮ Independent sets in graphs ⋮ Christoffel–Darboux Type Identities for the Independence Polynomial

Cites Work

• Clique polynomials and independent set polynomials of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Merrifield–Simmons Conjecture Holds for Bipartite Graphs