Two classes of edge domination in graphs (Q2492229): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4374706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On signed edge domination numbers of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4809187 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal graphs for inequalities involving domination parameters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4761533 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the lower bounds of signed domination number of a graph / rank | |||
Normal rank | |||
Latest revision as of 15:37, 24 June 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
