Abstract
One vertex union of two cycles is a kind of multi-cycle graphs. In this paper, the vertex degree distances of one vertex union of two cycles are calculated, and on this basis, the maximum and minimum of vertex degree distances are studied. The results show that the maximum vertex degree distances of one vertex union of two cycles is at the common intersection vertex and the minimum at the adjacent vertices of common intersection vertex.
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.
