Local dissymmetry on graphs and related algebraic structures
From MaRDI portal
Publication:5242804
DOI10.1142/S0218196719500607zbMath1423.05079OpenAlexW2968291094MaRDI QIDQ5242804
F. Infusino, Giampiero Chiaselotti, Tommaso Gentile
Publication date: 7 November 2019
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196719500607
automorphism groupgroup actionslocal dissymmetrysimple undirected graphsvertex subset binary operation
Hypergraphs (05C65) General structure theorems for groups (20E34) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Automorphism groups of groups (20F28)
Related Items
Alexandroff topologies and monoid actions ⋮ Pairings and related symmetry notions ⋮ Lattice representations with set partitions induced by pairings ⋮ Set relations and set systems induced by some families of integral domains ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ Granular computing on basic digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Graphs, hypergraphs, and properads
- Rectangular groupoids and related structures
- Graphs, partitions and classes of groups.
- A Landau's theorem in several complex variables
- Vertex decomposability and regularity of very well-covered graphs
- Cayley graph expanders and groups of finite width.
- Hypergraph families with bounded edge cover or transversal number
- The zero-divisor graph of a reduced ring
- Orderly algorithm to enumerate central groupoids and their graphs
- Recognition of some simple groups by their noncommuting graphs.
- Lower bounds for three algorithms for transversal hypergraph generation
- Algebraic structures on graphs
- On commuting polynomial automorphisms of \(\mathbb C^2\)
- Directed graphs and combinatorial properties of semigroups
- Notions from rough set theory in a generalized dependency relation context
- Zero divisor graphs of semigroups.
- The zero-divisor graph of a commutative semigroup
- An extension principle for closure operators
- Pairings and related symmetry notions
- The adjacency matrix of a graph as a data table: a geometric perspective
- Generated envelopes
- Simplicial complexes and closure systems induced by indistinguishability relations
- Dependency structures for decision tables
- On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
- Central elements in core-free groups
- ON THE TOTAL GRAPH OF A COMMUTATIVE RING WITHOUT THE ZERO ELEMENT
- Polynomial Functors and Trees
- Mutation classes of diagrams via infinite graphs
- Data Types with Symmetries and Polynomial Functors over Groupoids
- A NEW CHARACTERIZATION OF U4(7) BY ITS NONCOMMUTING GRAPH
- On the extremal Betti numbers of the binomial edge ideal of closed graphs
- SOME RESULTS ON THE INTERSECTION GRAPHS OF IDEALS OF RINGS
- Decision systems in rough set theory: A set operatorial perspective
- SYMMETRY GEOMETRY BY PAIRINGS
- Metric ends, fibers and automorphisms of graphs
- Asymmetric graphs
