1 resultado para Symmetric Even Graphs
em QSpace: Queen's University - Canada
Filtro por publicador
- University of Cagliari UniCA Eprints (1)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (3)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (8)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (9)
- Archive of European Integration (53)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (32)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (48)
- Boston University Digital Common (7)
- Brock University, Canada (13)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- CaltechTHESIS (8)
- Cambridge University Engineering Department Publications Database (53)
- CentAUR: Central Archive University of Reading - UK (54)
- Central European University - Research Support Scheme (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (66)
- Cochin University of Science & Technology (CUSAT), India (41)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (3)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (47)
- Department of Computer Science E-Repository - King's College London, Strand, London (6)
- Digital Archives@Colby (2)
- Digital Commons - Michigan Tech (4)
- Digital Peer Publishing (3)
- DigitalCommons@The Texas Medical Center (2)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (3)
- Duke University (2)
- Funes: Repositorio digital de documentos en Educación Matemática - Colombia (1)
- Greenwich Academic Literature Archive - UK (7)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (12)
- Indian Institute of Science - Bangalore - Índia (179)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (3)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (11)
- Nottingham eTheses (1)
- Publishing Network for Geoscientific & Environmental Data (18)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (63)
- Queensland University of Technology - ePrints Archive (56)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (5)
- Repositório Institucional da Universidade de Aveiro - Portugal (10)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (60)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (29)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universitat de Girona, Spain (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Montréal, Canada (4)
- University of Queensland eSpace - Australia (4)
- University of Southampton, United Kingdom (2)
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.