Next Article in Journal
Squaring the Circle and Cubing the Sphere: Circular and Spherical Copulas
Previous Article in Journal
Symmetry Aspects of the Band Structure and Motion Equations Applied in Calculating the Cyclotron Frequency of Electrons in Metals
Symmetry 2011, 3(3), 564-573; doi:10.3390/sym3030564

Green’s Symmetries in Finite Digraphs

Electromagnetic and Sensor Systems Department, 18444 Frontage Road Suite 327, Naval Surface Warfare Center Dahlgren Division, Dahlgren, VA 22448-5161, USA
Received: 2 March 2011 / Revised: 21 July 2011 / Accepted: 28 July 2011 / Published: 15 August 2011
Download PDF [331 KB, uploaded 15 August 2011]


The semigroup DV of digraphs on a set V of n labeled vertices is defined. It is shown that DV is faithfully represented by the semigroup Bn of n ´ n Boolean matrices and that the Green’s L, R, H, and D equivalence classifications of digraphs in DV follow directly from the Green’s classifications already established for Bn. The new results found from this are: (i) L, R, and H equivalent digraphs contain sets of vertices with identical neighborhoods which remain invariant under certain one-sided semigroup multiplications that transform one digraph into another within the same equivalence class, i.e., these digraphs exhibit Green’s isoneighborhood symmetries; and (ii) D equivalent digraphs are characterized by isomorphic inclusion lattices that are generated by their out-neighborhoods and which are preserved under certain two-sided semigroup multiplications that transform digraphs within the same D equivalence class, i.e., these digraphs are characterized by Green’s isolattice symmetries. As a simple illustrative example, the Green’s classification of all digraphs on two vertices is presented and the associated Green’s symmetries are identified.
Keywords: graph theory; digraph symmetries; semigroup; Green’s relations; structural invariance graph theory; digraph symmetries; semigroup; Green’s relations; structural invariance
This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Parks, A.D. Green’s Symmetries in Finite Digraphs. Symmetry 2011, 3, 564-573.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert