The adjacency matrix of a graph as a data table: a geometric perspective
From MaRDI portal
Publication:2362877
DOI10.1007/s10231-016-0608-1zbMath1366.05029OpenAlexW2517402701MaRDI QIDQ2362877
F. Infusino, Giampiero Chiaselotti, Tommaso Gentile, Paolo Antonio 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
Partitions of sets (05A18) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (23)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Locally finite complexes, modules and generalized information systems ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Object similarity measures and Pawlak's indiscernibility on decision tables ⋮ Alexandroff topologies and monoid actions ⋮ Categorification of a set relation geometry induced by rough operators ⋮ Dependency and accuracy measures for directed graphs ⋮ Some classes of abstract simplicial complexes motivated by module theory ⋮ Granular computing on information tables: families of subsets and operators ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ SYMMETRY GEOMETRY BY PAIRINGS ⋮ Pairings and related symmetry notions ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Dependency relations ⋮ Lattice representations with set partitions induced by pairings ⋮ Set relations and set systems induced by some families of integral domains ⋮ Finding strongly connected components of simple digraphs based on granulation strategy ⋮ Local dissymmetry on graphs and related algebraic structures ⋮ An application of fuzzy hypergraphs and hypergraphs in granular computing ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ Granular computing on basic digraphs
Cites Work
- A new discrete dynamical system of signed integer partitions
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- Sand piles: from physics to cellular automata models
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- Information systems in modeling interactive computations on granules
- An improved bound for the Manickam-Miklós-Singhi conjecture
- A bijective toolkit for signed partitions
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Formal concept analysis based on fuzzy granularity base for different granulations
- Covering based rough set approximations
- An application of rough sets to graph theory
- Interactive information systems: toward perception based computing
- Hypergraph families with bounded edge cover or transversal number
- A global parallel algorithm for the hypergraph transversal problem
- Rudiments of rough sets
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Geometries for sporadic groups related to the Petersen graph. II
- Rough-granular computing in knowledge discovery and data mining
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- A short note on some properties of rough groups.
- Discernibility matrix simplification for constructing attribute reducts
- Lower bounds for three algorithms for transversal hypergraph generation
- Cayley graphs as models of deterministic small-world networks
- First distribution invariants and EKR theorems
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Elements of a theory of computer simulation. I
- On a problem concerning the weight functions
- On a conjecture of Manickam and Singhi
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Vertex-symmetric generalized Moore graphs.
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Deterministic small-world networks
- Rough sets methodology for sorting problems in presence of multiple attributes and criteria
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Hadwiger's conjecture and inflations of the Petersen graph
- Lattices and ordered algebraic structures
- A dominance intuitionistic fuzzy-rough set approach and its applications
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum
- A matroidal approach to rough set theory
- Sand piles models of signed partitions with \(d\) piles
- Parallel rank of two sandpile models of signed integer partitions
- A discrete dynamical model of signed partitions
- A linear programming approach to the Manickam-Miklós-Singhi conjecture
- Association discovery from relational data via granular computing
- Combinatorics of sequential dynamical systems
- New results related to a conjecture of Manickam and Singhi
- A natural extension of the Young partition lattice
- Vertex Partitions of Graphs into Cographs and Stars
- An Investigation About Rough Set Theory: Some Foundational and Mathematical Aspects
- Granular computing approach to finding association rules in relational database
- 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
- Information Entropy and Granulation Co–Entropy of Partitions and Coverings: A Summary
- Geometries for sporadic groups related to the petersen graph. I
- Topics in Intersection Graph Theory
- 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
- On the Iterated Biclique Operator
- Biclique graphs and biclique matrices
- Simple Undirected Graphs as Formal Contexts
- Indirect Blockmodeling of 3-Way Networks
- Transactions on Rough Sets I
- Euler’s “De Partitio Numerorum”
- Asymmetric graphs
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Sequential dynamical systems over words
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The adjacency matrix of a graph as a data table: a geometric perspective
