An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.disc.2010.06.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060681653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total and paired-domination numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the paired-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired domination on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for the paired-domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in generalized claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in claw-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination number of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of cubic graphs with paired-domination number three-fifths their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large paired-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices contained in all or in no minimum paired-dominating set of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of paired-domination vertex critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination of trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:14, 3 July 2024

scientific article
Language Label Description Also known as
English
An upper bound on the paired-domination number in terms of the number of edges in the graph
scientific article

    Statements

    An upper bound on the paired-domination number in terms of the number of edges in the graph (English)
    0 references
    0 references
    19 October 2010
    0 references
    0 references
    bounds
    0 references
    paired domination set
    0 references
    paired domination number
    0 references
    minimum degree 2
    0 references
    size
    0 references
    perfect matching
    0 references
    0 references