Upper bounds on the \(k\)-forcing number of a graph (Q479006): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W2002502274 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.6206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approach to the \(k\)-independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Sequence Index Strategy / 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: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration Index of a Zero Forcing Set in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension and Zero Forcing Number of Two Families of Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-domination and \(j\)-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and bipartite circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2995153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for computing the zero forcing number of a graph with a cut-vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing number, path cover number, and maximum nullity of cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing number, constrained matchings and strong structural controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Zero Forcing Number of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 09:26, 9 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the \(k\)-forcing number of a graph
scientific article

    Statements

    Upper bounds on the \(k\)-forcing number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    zero forcing set
    0 references
    zero forcing number
    0 references
    \(k\)-forcing
    0 references
    \(k\)-forcing number
    0 references
    connected dominating sets
    0 references
    connected domination number
    0 references
    \(k\)-independence number
    0 references
    rank
    0 references
    nullity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references