Naslov
Global forcing number of benzenoid graphs

Autori
Došlić, Tomislav

Izvornik
Journal of Mathematical Chemistry (0259-9791) 41 (2007), 3; 217-229

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
global forcing number; benzenoid graph

Sažetak
A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove several results concerning global forcing sets and numbers of benzenoid graphs. In particular, we prove that all catacondensed benzenoids and catafused coronoids with n hexagons have the global forcing number equal to n, and that for pericondensed benze- noids the global forcing number is always strictly smaller than the number of hexagons.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA