Annihilators in graphs

DOI10.1007/BF03323401MaRDI QIDQ1123900zbMATH OpenOpenAlexFDO

Authors J. Nieminen

Publication date 1988

Published in Results in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03323401

zbMATH Keywords

distance in a graphgeodesic

Mathematics Subject Classification ID

Paths and cycles (05C38) Distributive lattices (06D99)

Review text

The author introduces the annihilator \(\lceil a,b\rceil\) of an undirected graph G to be the set of all vertices reachable from a by a geodesic via b, and relates it to a similar concept for lattices. \(\lceil a,b\rceil\) is called prime if \(\lceil a,b\rceil \cap \lceil b,a\rceil =\emptyset\) and \(\lceil a,b\rceil \cup \lceil b,a\rceil\) covers all the vertices of G. G is a prime annihilator intersection graph if each annihilator is the intersection of prime annihilators. Characterizations of the class of prime annihilator graphs (a superclass of the bipartite graphs) are given, and also some applications of annihilators to center problems.

Recommendations

• The annihilators comaximal graph
• Abstract annihilation graphs
• Annihilator graphs and semigroups of matrices
• scientific article; zbMATH DE number 7687421
• The annihilator graph of a 0-distributive lattice
• The annihilating graph of a ring
• Characterization of annihilating-ideal graph
• Annihilator graphs of commutator posets
• Annihilator ideals of graph algebras

Cites work

• Annihilators in modular lattices
• Distance center and centroid of a median graph
• Distance in graphs
• Relative annihilators in lattices

Cited in

(2)

• Annihilator characterizations of distributivity, modularity and semimodularity
• Centroids and medians of finite metric spaces

This page was built for publication: Annihilators in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123900)