Two classes of edge domination in graphs (Q2492229): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:49, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two classes of edge domination in graphs |
scientific article |
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
