Abstract
A bipartite digraph is said to be a half vertex transitive digraph if its automorphism acts transitively on the sets of its bipartition, respectively. In this paper, bipartite double coset digraphs of groups are defined and it is shown that any half vertex transitive digraph is isomorphic to some half double coset digraph, and we show that the connectivity of any strongly connected half transitive digraph is its minimum degree.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
