2021
DOI: 10.48550/arxiv.2102.08461
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

(-k)-critical trees and k-minimal trees

Walid Marweni

Abstract: In a graph G = (V, E), a module is a vertex subset M of V such that every vertex outside M is adjacent to all or none of M . For example, ∅, {x} (x ∈ V ) and V are modules of G, called trivial modules. A graph, all the modules of which are trivial, is prime; otherwise, it is decomposable.there is some k-vertex set X of vertices such that there is no proper induced subgraph of G containing X is prime. From this perspective, I. Boudabbous proposes to find the (−k)-critical graphs and k-minimal graphs for some in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 15 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?