On the nullity of a connected graph in terms of order and maximum degree (Q2244875): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q204509
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bit-Shun Tam / 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.laa.2021.09.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3199482904 / 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: Upper bounds on the \(k\)-forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic circuits from zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of tricyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with maximum nullity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values and bounds for the zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the zero forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of graphs with pendant trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity and the matching number of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on the zero forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondiscriminatory propagation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Zhou, Wong and Sun's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nullities of graphs with given order, matching number and cyclomatic number revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on the nullity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound of the nullity of a graph in terms of order and maximum degree / rank
 
Normal rank

Latest revision as of 04:36, 27 July 2024

scientific article
Language Label Description Also known as
English
On the nullity of a connected graph in terms of order and maximum degree
scientific article

    Statements

    On the nullity of a connected graph in terms of order and maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2021
    0 references
    nullity of a graph
    0 references
    rank
    0 references
    induced subgraph
    0 references
    0-basic subgraph
    0 references
    pendant \(K_2\) deletion
    0 references
    dual vertex
    0 references
    pendant-dual vertex
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers