The Merrifield-Simmons conjecture holds for bipartite graphs

Details The Merrifield-Simmons conjecture holds for bipartite graphs The Merrifield-Simmons conjecture holds for bipartite graphs

2010-06-22

arxiv.org/abs/1006.4253v2

Mathematics

Combinatorics

8 pages

Scientific paper

Let $G = (V, E)$ be a graph and $\sigma(G)$ the number of independent (vertex) sets in $G$. Then the Merrifield-Simmons conjecture states that the sign of the term $\sigma(G_{-u}) \cdot \sigma(G_{-v}) - \sigma(G) \cdot \sigma(G_{-u-v})$ only depends on the parity of the distance of the vertices $u, v \in V$ in $G$. We prove that the conjecture holds for bipartite graphs by considering a generalization of the term, where vertex subsets instead of vertices are deleted.

Affiliated with

Also associated with

No associations

Rating

The Merrifield-Simmons conjecture holds for bipartite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Merrifield-Simmons conjecture holds for bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Merrifield-Simmons conjecture holds for bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108021