Show simple item record

dc.contributor.authorGregory, David
dc.date.accessioned2010-07-28T14:50:18Z
dc.date.available2010-07-28T14:50:18Z
dc.date.issued2010-07-28T14:50:18Z
dc.identifier.urihttp://hdl.handle.net/1974/5946
dc.descriptionNotes based on seminar talks given at Queen's University and the Royal Military College, Kingston, 2009-10.en
dc.description.abstractA weighted variant of Hall's condition for the existence of matchings is shown to be equivalent to the existence of a matching in a lexicographic product. This is used to introduce characterizations of those bipartite graphs whose edges may be replicated so as to yield semiregular multigraphs or, equivalently, semiregular edge-weightings. Such bipartite graphs will be called semiregularizable. Some infinite families of semiregularizable trees are described and all semiregularizable trees on at most 11 vertices are listed. Matrix analogues of some of the results are mentioned and are shown to imply some of the known characterizations of regularizable graphs.en
dc.description.sponsorshipNSERC Canadaen
dc.language.isoenen
dc.relation.ispartofseriesSeminaren
dc.subjectHall's theorem, bipartite multigraphs, regular, semiregularen
dc.titleHall conditions for edge-weighted bipartite graphsen
dc.typeTechnical Reporten


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record