Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
Link opens in a new tab
English
עברית
العربية
Search content at Ariel University
Home
Profiles
Research units
Equipment
Research output
Prizes
Activities
Press/Media
Well-Covered Graphs With Constraints On Δ And δ
Vadim E. Levit
, David Tankus
Department of Mathematics
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
Well-covered Graph
100%
Well-covered
100%
NP-complete
100%
Relating Edge
75%
Generating Subgraph
75%
Maximal Independent Set
75%
NP-hard
50%
Weight Function
50%
CoNP-complete
50%
Cobalt Nanoparticles (CoNPs)
50%
Graph Families
50%
Cardinality
25%
Vertex Set
25%
Connected Graph
25%
Vector Space
25%
Bipartition
25%
Induced Subgraph
25%
Complete Bipartite
25%
Polynomial Problem
25%
Mathematics
Edge
100%
Independent Set
80%
Weight Function
40%
Polynomial
20%
Cardinality
20%
Induced Subgraph
20%
Connected Graph
20%
Vector Space
20%