Some classifications of graphs with respect to a set adjacency relation

DOI10.1142/S1793830920500895zbMath1458.05247OpenAlexW3043168940MaRDI QIDQ5859499

F. Infusino, Tommaso Gentile, Giampiero Chiaselotti

Publication date: 16 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500895

zbMATH Keywords

set operatorssimple undirected graphsgraph order classificationlattices by graphs

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Graph theory (05C99) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Asymptotic negative type properties of finite ultrametric spaces
• A Landau's theorem in several complex variables
• New rough approximations for \(n\)-cycles and \(n\)-paths
• The total bondage number of grid graphs
• Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
• Rank functions of closure spaces of finite rank
• Structural properties of twin-free graphs
• Nesting House-designs
• Enhanced negative type for finite metric trees
• On domination numbers of Cartesian products of paths
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
• Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
• \(L(2,1)\)-labeling of direct product of paths and cycles
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On the generalized roundness of finite metric spaces
• Alexandroff topologies and monoid actions
• Lattice representations with set partitions induced by pairings
• The granular partition lattice of an information table
• On periods and equilibria of computational sequential systems
• Set relations and set systems induced by some families of integral domains
• Anticoloring of the rook's graph
• The adjacency matrix of a graph as a data table: a geometric perspective
• Simplicial complexes and closure systems induced by indistinguishability relations
• The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
• On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
• On closed invariant sets in local dynamics
• Object similarity measures and Pawlak's indiscernibility on decision tables
• New composition of graphs and their Wiener indices
• Blocking Semiovals of Type (1,m+1,n+1)
• Unicyclic graphs with regular endomorphism monoids
• Rough sets on graphs: New dependency and accuracy measures
• Local dissymmetry on graphs and related algebraic structures
• Extending bicolorings for Steiner triple systems
• A characterization of some graphs with metric dimension two
• On the spectral radii and principal eigenvectors of uniform hypergraphs
• Decision systems in rough set theory: A set operatorial perspective
• SYMMETRY GEOMETRY BY PAIRINGS
• Asymmetric graphs
• Mathematical tools for data mining. Set theory, partial orders, combinatorics

This page was built for publication: Some classifications of graphs with respect to a set adjacency relation