Two classes of edge domination in graphs (Q2492229): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1005247
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2005.12.007 / rank
Normal rank
 
Property / author
 
Property / author: Bao-Gen Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091945690 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2005.12.007 / rank
 
Normal rank

Latest revision as of 00:38, 19 December 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
    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 references

    Identifiers