Computing the minimum forcing number of perfect matchings of a graph is an NP-complete problem. In this paper, we consider boron–nitrogen (BN) fullerene graphs, ...

It is shown that any finite set of positive integers can be the anti-forcing spectrum of a graph and that determining theAnti-forcing number of a perfect ...

In this paper, we consider boron–nitrogen (BN) fullerene graphs, cubic 3-connected plane bipartite graphs with exactly six square faces and other hexagonal ...

Jul 13, 2011 · In this paper we consider boron–nitrogen fullerene graphs, the molecular graphs of boron–nitrogen fullerenes. In fact, a boron–nitrogen ...

Computing the minimum forcing number of perfect matchings of a graph is an NP-complete problem. In this paper, we consider boron–nitrogen (BN) fullerene graphs, ...

In this paper, we investigate the eccentric connectivity index and connective eccentricity index of boron-nitrogen fullerenes, respectively. And we give ...

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- ...

Видання: Discrete Applied Mathematics, 2011, № 15, с. 1581-1593 ; Видавець: Elsevier BV ; Автори: Xiaoyan Jiang, Heping Zhang ; Джерело фінансування: National ...

A k-matching is a matching with k edges. The total number of matchings in G is used in chemoinformatics as a structural descriptor of a molecular graph.

Boron-nitrogen fullerenes (or BN-fullerene graphs) are cubic ... Jiang, H. P. Zhang, On the forcing matching number of boron-nitrogen fullerene graphs, Discr.