2024
DOI: 10.3390/sym16060663
|View full text |Cite
|
Sign up to set email alerts
|

Characterizations of Minimal Dominating Sets in γ-Endowed and Symmetric γ-Endowed Graphs with Applications to Structure-Property Modeling

Sakander Hayat,
Raman Sundareswaran,
Marayanagaraj Shanmugapriya
et al.

Abstract: Claude Berge (1987) introduced the concept of k-extendable graphs, wherein any independent set of size k is inherently a constituent of a maximum independent set within a graph H=(V,E). Graphs possessing the property of being 1-extendable are termedas Berge graphs. This introduction gave rise to the notion of well-covered graphs and well-dominated graphs. A graph is categorized as well-covered if each of its maximal independent sets is, in fact, a maximum independent set. Similarly, a graph attains the classif… 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 51 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?