Indiscernibility structures induced from function sets : Graph and digraph case
From MaRDI portal
Publication:5031926
DOI10.1080/09720529.2018.1443627zbMath1481.06030OpenAlexW2890187160WikidataQ129326424 ScholiaQ129326424MaRDI QIDQ5031926
F. Infusino, Giampiero Chiaselotti, Paolo Antonio Oliverio, Tommaso Gentile
Publication date: 16 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2018.1443627
Partial orders, general (06A06) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20) Fuzzy lattices (soft algebras) and related topics (06D72)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Intersection properties of maximal directed cuts in digraphs
- Graph and matrix approaches to rough sets through matroids
- Power contexts and their concept lattices
- New rough approximations for \(n\)-cycles and \(n\)-paths
- An application of rough sets to graph theory
- Hypergraph families with bounded edge cover or transversal number
- Representation of functional dependencies in relational databases using linear graphs
- Nullity-based matroid of rough sets and its application to attribute reduction
- Nesting House-designs
- Lower bounds for three algorithms for transversal hypergraph generation
- Subdirect product construction of concept lattices
- Algebraic dependencies
- Union-closed families
- Concept lattices and conceptual knowledge systems
- Selective inheritance of attribute values in relational databases
- Elements of a theory of computer simulation. I
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Simple graphs in granular computing
- Dominance order on signed integer partitions
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- The basic theorem of triadic concept analysis
- A matroidal approach to rough set theory
- Pairings and related symmetry notions
- Recognizing Helly edge-path-tree graphs and their clique graphs
- The granular partition lattice of an information table
- On the Galois lattice of bipartite distance hereditary graphs
- The adjacency matrix of a graph as a data table: a geometric perspective
- Dependency structures for decision tables
- The maximum vertex coverage problem on bipartite graphs
- Combinatorics of sequential dynamical systems
- A natural extension of the Young partition lattice
- Information granulation and rough set approximation
- Relations on Hypergraphs
- Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs
- Degrees of acyclicity for hypergraphs and relational database schemes
- Self-organized criticality
- The Lattice Structure of Equally Extended Signed Partitions
- Preclusivity and Simple Graphs
- Preclusivity and Simple Graphs: The n–cycle and n–path Cases
- Rough Set Theory Applied to Simple Undirected Graphs
- Generalizations of Rough Set Tools Inspired by Graph Theory
- Rough Set Theory and Digraphs
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture
- Simple Undirected Graphs as Formal Contexts
- Extending bicolorings for Steiner triple systems
- Transactions on Rough Sets I
- Rough Set Characterization for 2-circuit Matroid
- Euler’s “De Partitio Numerorum”
- Digraphs
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Granular computing. An emerging paradigm
This page was built for publication: Indiscernibility structures induced from function sets : Graph and digraph case
