OpenAlex | A sharp upper bound for the number of stable sets in graphs with given number of cut edges

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

Work

Year: 2009

Type: article

Source: Applied Mathematics Letters

Author Hongbo Hua

Institutions Northwestern Polytechnical University, Huaiyin Institute of Technology

Cites: 14

Cited by: 16

Related to: 10

FWCI: 1.737

Citation percentile (by year/subfield): 76.43

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: closed