A note on connected domination number and leaf number (Q2099474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves in Graphs With Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Domination and Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the connected domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum leaf number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, radius, and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the leaf number in graphs of girth 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning paths and cycles in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the leaf number in graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity, minimum degree and leaf number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius, leaf number, connected domination number and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Degree, Leaf Number, and Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbres avec un nombre maximum de sommets pendants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank

Revision as of 22:05, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on connected domination number and leaf number
scientific article

    Statements

    A note on connected domination number and leaf number (English)
    0 references
    0 references
    0 references
    23 November 2022
    0 references
    connected domination number
    0 references
    minimum degree
    0 references
    order
    0 references
    leaf number
    0 references

    Identifiers