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

The Art of Discrete and Applied Mathematics
doi 10.26493/2590-9770.1258.c2b
Full Text
Abstract

Available in full text

Date
Authors
Publisher

University of Primorska Press

Related search

The Upper Connected Edge Geodetic Number of a Graph

Filomat
Mathematics
2012English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

Inverse and Disjoint Connected Cototal Domination Number of the Jump Graph of a Graph

International Journal of Research in Advent Technology
2019English

Global Triple Connected Domination Number of a Graph

IOSR Journal of Mathematics
2016English

Connected Plane Sets Which Contain No Nondegenerate Connected Simple Graph

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1991English

Connectivity in a Bipolar Fuzzy Graph and Its Complement

Annals of Pure and Applied Mathematics
2017English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Comparison of Roman Domination Number With Domination Number, Independent Domination Number and Chromatic Number of a Graph

International Journal for Research in Applied Science and Engineering Technology
2019English

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

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy