No label defined (Q3828043)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4103125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4103125 |
Statements
1988
0 references
independent set
0 references
dominating set
0 references
locating set
0 references
EIDL
0 references
0.8920310139656067
0 references
0.8893052935600281
0 references
0.8880535960197449
0 references
[For the entire collection see Zbl 0665.00002.] A well-covered graph is one in which every maximal independent set of vertices is a maximum. A dominating set D of vertices is such that for any \(v\not\in D\), N(v)\(\cap D\neq \emptyset\), where N(v) represents all vertices adjacent to v. A dominating set D of vertices is said to be locating if for every pair of vertices u,v not in D, N(u)\(\cap D\neq N(v)\cap D\). A graph in which every dominating set is a locating set will be called an EDL graph and one in which every independent dominating set is locating will be called an EIDL graph. It is proved that all EIDL graphs are well-covered and that every vertex in an EDL graph (with three exceptions) is either of degree one or adjacent to a vertex of degree one.
0 references