We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
The majorization relation orders the degree sequences of simple graphs intoposets called dominance orders. As shown by Ruch and Gutman (1979) and Merris(2002), the degree sequences of threshold and split graphs form upward-closedsets within the dominance orders they belong to, i.e., any degree sequencemajorizing a split or threshold sequence must itself be split or threshold,respectively. Motivated by the fact that threshold graphs and split graphs havecharacterizations in terms of forbidden induced subgraphs, we define a classF of graphs to be dominance monotone if whenever no realization ofe contains an element F as an induced subgraph, and d majorizese, then no realization of d induces an element of F. We presentconditions necessary for a set of graphs to be dominance monotone, and weidentify the dominance monotone sets of order at most 3.Comment: 19 pages, 5 figures. Final accepted versio
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.