Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Activities
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Well-Covered Graphs With Constraints On Δ And δ
Vadim E. Levit, David Tankus
Ariel University
Sami Shamoon College of Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Well-Covered Graphs With Constraints On Δ And δ'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bipartition
25%
Cardinality
25%
Cobalt Nanoparticles (CoNPs)
50%
Complete Bipartite
25%
Connected Graph
25%
CoNP-complete
50%
Generating Subgraph
75%
Graph Families
50%
Induced Subgraph
25%
Maximal Independent Set
75%
NP-complete
100%
NP-hard
50%
Polynomial Problem
25%
Relating Edge
75%
Vector Space
25%
Vertex Set
25%
Weight Function
50%
Well-covered
100%
Well-covered Graph
100%
Mathematics
Cardinality
20%
Connected Graph
20%
Edge
100%
Independent Set
80%
Induced Subgraph
20%
Polynomial
20%
Vector Space
20%
Weight Function
40%