Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Covering Cycle Matroid
View through CrossRef
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data. Matroids are based on linear algebra and graph theory and have a variety of applications in many fields. In this paper, we construct two types of covering cycle matroids by a covering and then study the graphical representations of these two types of matriods. First, through defining a cycle graph by a set, the
type-1 covering cycle matroid is constructed by a covering. By a dual graph of the cycle graph, the covering can also induce the type-2 covering cycle matroid. Second, some characteristics of these two types of matroids are formulated by a covering, such as independent sets, bases, circuits, and support sets. Third, a coarse covering of a covering is defined to study the graphical representation of the type-1 covering cycle matroid. We prove that the type-1 covering cycle matroid is graphic while the type-2 covering cycle matroid is not always a graphic matroid. Finally, relationships between these two types of matroids and the function matroid are studied. In a word, borrowing from matroids, this work presents an interesting view, graph, to investigate covering-based rough sets.
Title: Covering Cycle Matroid
Description:
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data.
Matroids are based on linear algebra and graph theory and have a variety of applications in many fields.
In this paper, we construct two types of covering cycle matroids by a covering and then study the graphical representations of these two types of matriods.
First, through defining a cycle graph by a set, the
type-1 covering cycle matroid is constructed by a covering.
By a dual graph of the cycle graph, the covering can also induce the type-2 covering cycle matroid.
Second, some characteristics of these two types of matroids are formulated by a covering, such as independent sets, bases, circuits, and support sets.
Third, a coarse covering of a covering is defined to study the graphical representation of the type-1 covering cycle matroid.
We prove that the type-1 covering cycle matroid is graphic while the type-2 covering cycle matroid is not always a graphic matroid.
Finally, relationships between these two types of matroids and the function matroid are studied.
In a word, borrowing from matroids, this work presents an interesting view, graph, to investigate covering-based rough sets.
Related Results
Parallel algorithms for matroid intersection and matroid parity
Parallel algorithms for matroid intersection and matroid parity
A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic mat...
Topics in matroid union
Topics in matroid union
The operation of matroid union was introduced by Nash-Williams in 1966. A
matroid is indecomposable if it cannot be written in the form M = M1 V
M2, where r(M1),r(M2) > 0. In ...
Peningkatan Prestasi Belajar Materi Bilangan Berpangkat Melalui Model Discovery Learning
Peningkatan Prestasi Belajar Materi Bilangan Berpangkat Melalui Model Discovery Learning
This research is motivated by the unoptimally the mastery of the material is still not optimal exponential number among learners and implementation Discovery learning in mathematic...
Faster Matroid Partition Algorithms
Faster Matroid Partition Algorithms
In the matroid partitioning problem, we are given
\(k\)
matroids
\(\mathcal{M}_{1}=(V,\mathcal{I}_{1}...
On Density-Critical Matroids
On Density-Critical Matroids
For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper min...
Matroids, Cyclic Flats, and Polyhedra
Matroids, Cyclic Flats, and Polyhedra
<p>Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are able to be efficiently ...
Kinerja Guru Bimbingan Konseling Dalam Penyusunan Rencana Program Layanan Melalui Pendampingan Supervisi Klinis
Kinerja Guru Bimbingan Konseling Dalam Penyusunan Rencana Program Layanan Melalui Pendampingan Supervisi Klinis
This research is motivated by the unoptimally performance of teachers in a planning service program has so far not optimal. The research objective is to improve the performance of ...
On analogs of Cremona automorphisms for matroid fans
On analogs of Cremona automorphisms for matroid fans
Matroids are combinatorial objects that generalize linear independence. A matroid can be represented geometrically by its Bergman fan and we compare the symmetries of these two obj...