Connectedness of graphs and its application to connected matroids through covering-based rough sets release_r6iwnzyjzncbrb7fc6e6htva34 [as of editgroup_4cl2ufvmnjbl5eq4drkjfkf56i]

by Aiping Huang, William Zhu

Released as a article .

2015  

Abstract

Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and covering-based rough sets provide a systematic approach to this type of representation. In this paper, we study the connectedness of graphs through covering-based rough sets and apply it to connected matroids. First, we present an approach to inducing a covering by a graph, and then study the connectedness of the graph from the viewpoint of the covering approximation operators. Second, we construct a graph from a matroid, and find the matroid and the graph have the same connectedness, which makes us to use covering-based rough sets to study connected matroids. In summary, this paper provides a new approach to studying graph theory and matroid theory.
In text/plain format

Type  article
Stage   submitted
Date   2015-03-04
Version   v3
Language   en ?
arXiv  1312.4234v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Work In Progress

This entity has not been "accepted" into the official database yet.

Catalog Record
State: wip
Revision: 20d00351-42a1-4e58-b39d-2702f6235d0a
API URL: JSON