The adjacency matrix of a graph as a data table: a geometric perspective
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5129599 (Why is no real title available?)
- scientific article; zbMATH DE number 5282844 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 108581 (Why is no real title available?)
- scientific article; zbMATH DE number 1043733 (Why is no real title available?)
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- scientific article; zbMATH DE number 1864854 (Why is no real title available?)
- scientific article; zbMATH DE number 3071015 (Why is no real title available?)
- A bijective toolkit for signed partitions
- A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
- A discrete dynamical model of signed partitions
- A dominance intuitionistic fuzzy-rough set approach and its applications
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- A global parallel algorithm for the hypergraph transversal problem
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- A matroidal approach to rough set theory
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- A short note on some properties of rough groups.
- An application of rough sets to graph theory
- An improved bound for the Manickam-Miklós-Singhi conjecture
- An investigation about rough set theory: some foundational and mathematical aspects
- Association discovery from relational data via granular computing
- Asymmetric graphs
- Biclique graphs and biclique matrices
- Cayley graphs as models of deterministic small-world networks
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Combinatorics of sequential dynamical systems
- Covering based rough set approximations
- Deterministic small-world networks
- Discernibility matrix simplification for constructing attribute reducts
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Elements of a theory of computer simulation. I
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Elements of a theory of simulation. III: Equivalence of SDS.
- Euler’s “De Partitio Numerorum”
- First distribution invariants and EKR theorems
- Formal concept analysis based on fuzzy granularity base for different granulations
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Geometries for sporadic groups related to the Petersen graph. II
- Geometries for sporadic groups related to the petersen graph. I
- Granular computing approach to finding association rules in relational database
- Graph theory
- Hadwiger's conjecture and inflations of the Petersen graph
- Hypergraph families with bounded edge cover or transversal number
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Indirect Blockmodeling of 3-Way Networks
- Information Entropy and Granulation Co–Entropy of Partitions and Coverings: A Summary
- Information systems in modeling interactive computations on granules
- Interactive information systems: toward perception based computing
- Lattices and ordered algebraic structures
- Lattices of partial sums.
- Lower bounds for three algorithms for transversal hypergraph generation
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- New results related to a conjecture of Manickam and Singhi
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- On a conjecture of Manickam and Singhi
- On a problem concerning the weight functions
- On symmetry of uniform and preferential attachment graphs
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- On the iterated biclique operator
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Parallel rank of two sandpile models of signed integer partitions
- Preclusivity and simple graphs
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Rough Set Theory Applied to Simple Undirected Graphs
- Rough sets and Boolean reasoning
- Rough sets methodology for sorting problems in presence of multiple attributes and criteria
- Rough sets: some extensions
- Rough-granular computing in knowledge discovery and data mining
- Rudiments of rough sets
- Sand piles models of signed partitions with d piles
- Sand piles: from physics to cellular automata models
- Sequential dynamical systems over words
- Simple Undirected Graphs as Formal Contexts
- Temporal dynamics in information tables
- The Lattice Structure of Equally Extended Signed Partitions
- Topics in Intersection Graph Theory
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Transactions on Rough Sets I
- Vertex partitions of graphs into cographs and stars
- Vertex-symmetric generalized Moore graphs.
Cited in
(26)- Indiscernibility structures induced from function sets: graph and digraph case
- Locally finite complexes, modules and generalized information systems
- Object similarity measures and Pawlak's indiscernibility on decision tables
- Decision systems in rough set theory: a set operatorial perspective
- New perspectives of granular computing in relation geometry induced by pairings
- Some classifications of graphs with respect to a set adjacency relation
- Set relations and set systems induced by some families of integral domains
- Aggregation of fuzzy graphs
- Notions from rough set theory in a generalized dependency relation context
- Dependency and accuracy measures for directed graphs
- Dependency relations
- Pairings and related symmetry notions
- Granular computing on basic digraphs
- Granular computing on information tables: families of subsets and operators
- Alexandroff topologies and monoid actions
- Some classes of abstract simplicial complexes motivated by module theory
- Simplicial complexes and closure systems induced by indistinguishability relations
- Categorification of a set relation geometry induced by rough operators
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Symmetry geometry by pairings
- An application of fuzzy hypergraphs and hypergraphs in granular computing
- Local dissymmetry on graphs and related algebraic structures
- Lattice representations with set partitions induced by pairings
- Finding strongly connected components of simple digraphs based on granulation strategy
- Simple graphs in granular computing
- Rough sets on graphs: new dependency and accuracy measures
This page was built for publication: The adjacency matrix of a graph as a data table: a geometric perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362877)
