On the Product of Upper Irredundance Numbers of a Graph and Its Complement

Discrete Mathematics - Netherlands
doi 10.1016/0012-365x(89)90304-x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

The Number of Independent Sets in a Connected Graph and Its Complement

The Art of Discrete and Applied Mathematics
2018English

Connectivity in a Bipolar Fuzzy Graph and Its Complement

Annals of Pure and Applied Mathematics
2017English

Upper Bounds on the Bondage Number of a Graph

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

On a Binomial Coefficient and a Product of Prime Numbers

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2011English

The Conjugate Formal Product of a Graph

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2007English

The Upper Connected Edge Geodetic Number of a Graph

Filomat
Mathematics
2012English

Upper Double Monophonic Number of a Graph

Proyecciones
Mathematics
2018English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

The Chromatic Numbers of Graph Bundles Over Cycles

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy