Abstract
Median graphs are a natural generalisation of trees and hypercubes that are closely related to distributive lattices and graph retracts. In the past decade, they have become of increasing interest to the biological community, where, amongst other things, they are applied to the study of evolutionary relationships within populations. Two simple measures of complexity for a median graph are the number of vertices and the number of maximal induced subcubes. These numbers can be useful in biological applications, and they are also of purely mathematical interest. However, they can be hard to compute in general. Here we present some special families of median graphs where it is possible to find formulae and recursions for these numbers.
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.
