The adjacency matrix of a graph as a data table: a geometric perspective
From MaRDI portal
Publication:2362877
DOI10.1007/S10231-016-0608-1zbMATH Open1366.05029OpenAlexW2517402701MaRDI QIDQ2362877FDOQ2362877
Authors: G. Chiaselotti, F. Infusino, T. Gentile, Paolo A. Oliverio 
Publication date: 14 July 2017
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10231-016-0608-1
Recommendations
Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Cites Work
- Graph theory
- Topics in Intersection Graph Theory
- Association discovery from relational data via granular computing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rough-granular computing in knowledge discovery and data mining
- Indirect Blockmodeling of 3-Way Networks
- First distribution invariants and EKR theorems
- 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
- Lattices and ordered algebraic structures
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Sand piles models of signed partitions with \(d\) piles
- Combinatorics of sequential dynamical systems
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- The Lattice Structure of Equally Extended Signed Partitions
- Sand piles: from physics to cellular automata models
- A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
- Euler’s “De Partitio Numerorum”
- Sequential dynamical systems over words
- A bijective toolkit for signed partitions
- Rudiments of rough sets
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Asymmetric graphs
- Covering based rough set approximations
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Title not available (Why is that?)
- Biclique graphs and biclique matrices
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- Formal concept analysis based on fuzzy granularity base for different granulations
- Rough sets methodology for sorting problems in presence of multiple attributes and criteria
- Cayley graphs as models of deterministic small-world networks
- Title not available (Why is that?)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- Coloring the hypergraph of maximal cliques of a graph with no long path
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- An improved bound for the Manickam-Miklós-Singhi conjecture
- Discernibility matrix simplification for constructing attribute reducts
- On a conjecture of Manickam and Singhi
- On a problem concerning the weight functions
- New results related to a conjecture of Manickam and Singhi
- Information Entropy and Granulation Co–Entropy of Partitions and Coverings: A Summary
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transactions on Rough Sets I
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Temporal dynamics in information tables
- Title not available (Why is that?)
- On the iterated biclique operator
- An application of rough sets to graph theory
- Hadwiger's conjecture and inflations of the Petersen graph
- Vertex partitions of graphs into cographs and stars
- A dominance intuitionistic fuzzy-rough set approach and its applications
- A matroidal approach to rough set theory
- A short note on some properties of rough groups.
- Lower bounds for three algorithms for transversal hypergraph generation
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Hypergraph families with bounded edge cover or transversal number
- Deterministic small-world networks
- Information systems in modeling interactive computations on granules
- Parallel rank of two sandpile models of signed integer partitions
- A discrete dynamical model of signed partitions
- Lattices of partial sums.
- Simple Undirected Graphs as Formal Contexts
- Geometries for sporadic groups related to the Petersen graph. II
- A global parallel algorithm for the hypergraph transversal problem
- Interactive information systems: toward perception based computing
- Geometries for sporadic groups related to the petersen graph. I
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Vertex-symmetric generalized Moore graphs.
- Title not available (Why is that?)
- On symmetry of uniform and preferential attachment graphs
- An investigation about rough set theory: some foundational and mathematical aspects
- Preclusivity and simple graphs
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Granular computing approach to finding association rules in relational database
- Rough Set Theory Applied to Simple Undirected 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
- Dependency and accuracy measures for directed graphs
- Notions from rough set theory in a generalized dependency relation context
- 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
- Categorification of a set relation geometry induced by rough operators
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Simplicial complexes and closure systems induced by indistinguishability relations
- 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)
