1 resultado para RANDOM REGULAR GRAPHS
em QSpace: Queen's University - Canada
Filtro por publicador
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Aberystwyth University Repository - Reino Unido (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (7)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (11)
- Aston University Research Archive (10)
- Biblioteca Digital da Câmara dos Deputados (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (3)
- Boston University Digital Common (12)
- Brock University, Canada (16)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (10)
- Cambridge University Engineering Department Publications Database (99)
- CentAUR: Central Archive University of Reading - UK (3)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (77)
- Cochin University of Science & Technology (CUSAT), India (42)
- Deakin Research Online - Australia (6)
- Department of Computer Science E-Repository - King's College London, Strand, London (4)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (6)
- Diposit Digital de la UB - Universidade de Barcelona (12)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (8)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (4)
- Funes: Repositorio digital de documentos en Educación Matemática - Colombia (1)
- Greenwich Academic Literature Archive - UK (6)
- Helda - Digital Repository of University of Helsinki (19)
- Indian Institute of Science - Bangalore - Índia (234)
- Instituto Politécnico do Porto, Portugal (3)
- Massachusetts Institute of Technology (7)
- Ministerio de Cultura, Spain (15)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (6)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (128)
- Queensland University of Technology - ePrints Archive (115)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (12)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (17)
- Repositorio Institucional de la Universidad Nacional Agraria (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (2)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (5)
- South Carolina State Documents Depository (2)
- Universidad Autónoma de Nuevo León, Mexico (15)
- Universidad de Alicante (3)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (2)
- Universitat de Girona, Spain (8)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (13)
- University of Queensland eSpace - Australia (1)
- University of Southampton, United Kingdom (3)
- University of Washington (1)
- WestminsterResearch - UK (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.