Two classes of edge domination in graphs (Q2492229)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two classes of edge domination in graphs |
scientific article; zbMATH DE number 5030515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two classes of edge domination in graphs |
scientific article; zbMATH DE number 5030515 |
Statements
Two classes of edge domination in graphs (English)
0 references
9 June 2006
0 references
The purpose of the paper is to show that the number of signed edge dominations of a graph of order \(n\) is bounded above by \(11n/6 - 1\) and that the number of local signed edge dominations of a graph of order \(n\) is bounded above by \(2n - 4\).
0 references
local signed edge domination function
0 references
local signed edge domination number
0 references
signed edge domination function
0 references
signed edge domination number
0 references
0.98293865
0 references
0.9563407
0 references
0.9423579
0 references
0 references
0 references
0.9125773
0 references
0 references
0 references
