Abstract
Let S=(a1,…,am;b1,…,bn) be a pair of two nonincreasing sequences of positive integers, that is, a1,…,am and b1,…,bn are two nonincreasing sequences of positive integers. The pair S=(a1,…,am;b1,…,bn) is said to be a bigraphic pair if there is a simple bipartite graph G=(X∪Y,E) such that a1,…,am and b1,…,bn are the degrees of the vertices in X and Y, respectively. In this paper, we give a simple sufficient condition for a pair S=(a1,…,am;b1,…,bn) to be a bigraphic pair. The condition depends only on the lengths of two sequences of the pair and their largest and smallest elements. This result extends a result due to Alon et al. (2010).
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.
