Abstract
An oriented graph is a digraph without loops and multiple arcs, where is called the underlying graph of . Let denote the skew-adjacency matrix of . The rank of is called the skew-rank of , denoted by , which is even since is skew symmetric. Recently, Qu and Yu proved that for an oriented bicyclic graph with pendant vertices and with two edge-disjoint cycles of size and . In this paper, we extend this result to a more general case. It is proved that if is a connected oriented graph with pairwise edge-disjoint cycles of size . Moreover, the extremal graphs attaining the lower bound are characterized.
Sign-in/Register to access full text options 
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.
