Connectedness of graphs and its application to connected matroids through covering-based rough sets (Q2402114)

From MaRDI portal
Revision as of 02:30, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Connectedness of graphs and its application to connected matroids through covering-based rough sets
scientific article

    Statements

    Connectedness of graphs and its application to connected matroids through covering-based rough sets (English)
    0 references
    0 references
    0 references
    6 September 2017
    0 references
    covering-based rough set
    0 references
    connected graph
    0 references
    approximation operator
    0 references
    connected matroid
    0 references
    matrix
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references