Edge domination in some path and cycle related graphs (Q470539)
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 6368849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge domination in some path and cycle related graphs |
scientific article; zbMATH DE number 6368849 |
Statements
Edge domination in some path and cycle related graphs (English)
0 references
12 November 2014
0 references
Summary: For a graph \(G=(V,E)\), a subset \(F\) of \(E\) is called an edge dominating set of \(G\) if every edge not in \(F\) is adjacent to some edge in \(F\). The edge domination number \(\gamma'(G)\) of \(G\) is the minimum cardinality taken over all edge dominating sets of \(G\). Here, we determine the edge domination number for shadow graphs, middle graphs, and total graphs of paths and cycles.
0 references
0 references
0.8716335892677307
0 references
0.8538554906845093
0 references
0.8531877994537354
0 references
0.8520336151123047
0 references
