31 resultados para Directed graphs
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (223)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (19)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- Biodiversity Heritage Library, United States (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (59)
- Boston University Digital Common (6)
- Brock University, Canada (23)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (24)
- CentAUR: Central Archive University of Reading - UK (41)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (26)
- Cochin University of Science & Technology (CUSAT), India (31)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Deakin Research Online - Australia (52)
- Department of Computer Science E-Repository - King's College London, Strand, London (13)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (4)
- Digital Commons at Florida International University (1)
- Digital Knowledge Repository of Central Drug Research Institute (1)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (3)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Duke University (4)
- Greenwich Academic Literature Archive - UK (8)
- Harvard University (2)
- Helda - Digital Repository of University of Helsinki (7)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (126)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (4)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (58)
- Publishing Network for Geoscientific & Environmental Data (16)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (83)
- Queensland University of Technology - ePrints Archive (43)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (7)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (14)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- School of Medicine, Washington University, United States (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (15)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universita di Parma (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (4)
- University of Connecticut - USA (2)
- University of Michigan (2)
- University of Queensland eSpace - Australia (1)
- University of Southampton, United Kingdom (2)
Resumo:
A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed