Abstract
The class of unicyclic $3$-colored digraphs with the cycle weight $\pm\mathrm{i}$ and with a unique perfect matching, denoted by $\mathcal{U}_g$, is considered in this article. Kalita \& Sarma [On the inverse of unicyclic 3-coloured digraphs, Linear and Multilinear Algebra, DOI: 10.1080/03081087.2021.1948956] introduced the notion of inverse of $3$-colored digraphs. They characterized the unicyclic $3$-colored digraphs in $\mathcal{U}_g$ possessing unicyclic inverses. This article provides a complete characterization of the unicyclic $3$-colored digraphs in $\mathcal{U}_g$ possessing bicyclic inverses.
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.
