http://dx.doi.org/10.1016/j.dam.2009.10.013">
 

Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

Forcing matching numbers of fullerene graphs

Language

English

Abstract

The forcing number or the degree of freedom of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matchings of G. In this paper we show that the forcing numbers of perfect matchings in a fullerene graph are not less than 3 by applying the 2-extendability and cyclic edge-connectivity 5 of fullerene graphs obtained recently, and Kotzig's classical result about unique perfect matching as well. This lower bound can be achieved by infinitely many fullerene graphs. © 2009 Elsevier B.V. All rights reserved.

Keywords

Degree of freedom, Forcing number, Fullerene graph, Perfect matching

Publication Date

2010

Source Publication Title

Discrete Applied Mathematics

Volume

158

Issue

5

Start Page

573

End Page

582

Publisher

Elsevier

ISSN (print)

0166218X

This document is currently not available here.

Share

COinS