1 resultado para EXPANDER GRAPHS
em QSpace: Queen's University - Canada
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (2)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (13)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (227)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (12)
- Aston University Research Archive (22)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (8)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (12)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (10)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (25)
- Boston University Digital Common (14)
- Brock University, Canada (12)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (5)
- Cambridge University Engineering Department Publications Database (25)
- CentAUR: Central Archive University of Reading - UK (14)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (27)
- Cochin University of Science & Technology (CUSAT), India (32)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Cornell: DigitalCommons@ILR (2)
- Deakin Research Online - Australia (15)
- Department of Computer Science E-Repository - King's College London, Strand, London (6)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (4)
- Digital Commons at Florida International University (1)
- Digital Peer Publishing (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Greenwich Academic Literature Archive - UK (14)
- Helda - Digital Repository of University of Helsinki (17)
- Indian Institute of Science - Bangalore - Índia (188)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (4)
- Nottingham eTheses (2)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (15)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (50)
- Queensland University of Technology - ePrints Archive (72)
- Repositório Científico da Universidade de Évora - Portugal (3)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (11)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (12)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (9)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Montréal, Canada (1)
- University of Michigan (19)
- University of Queensland eSpace - Australia (15)
- University of Southampton, United Kingdom (2)
- University of Washington (1)
Resumo:
A 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.