Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Letícia Rodrigues Bueno"'
Autor:
Victor R. Ramos, Dieter Rautenbach, Fábio Protti, Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso
Publikováno v:
Information Processing Letters. 135:22-27
A set of vertices D of a graph G is geodetic if every vertex of G lies in a shortest path between two vertices in D. The geodetic number of G is the minimum cardinality of a geodetic set of G, and deciding whether it is at most k is an NP-complete pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a424303e2d78791c19e3f2d7c98db85
https://doi.org/10.1016/j.ipl.2018.02.012
https://doi.org/10.1016/j.ipl.2018.02.012
Publikováno v:
Revista Eletrônica de Iniciação Científica em Computação; v. 16, n. 1 (2018): REIC-Edição Especial-Artigos do CTIC 2013
O grafo ímpar Ok é o grafo cujos vértices são todos os subconjuntos de tamanho k de um conjunto com (2k+1) elementos e dois vértices são adjacentes se eles são disjuntos. Uma conjectura atribuída a Biggs afirma que o grafo Ok é hamiltoniano
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6957df933899a1e7cd01a7f83e930832
https://doi.org/10.5753/reic.2018.1808
https://doi.org/10.5753/reic.2018.1808
Autor:
Luis Antonio Brasil Kowada, C.S. Reis, A. C. Ribeiro, Celina M. H. de Figueiredo, Letícia Rodrigues Bueno
Publikováno v:
Discrete Applied Mathematics. 192:82-86
Cayley graphs have been extensively studied by graph and group theorists, computer scientists, molecular biologists and coding theorists. We focus on two challenging problems on Cayley graphs arising on sequence comparison: hamiltonian cycle and grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16d2bd602955bd05c578f5527634007b
https://doi.org/10.1016/j.dam.2014.05.003
https://doi.org/10.1016/j.dam.2014.05.003
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Optimization methods for spanning tree problems may require efficient data structures. The node-depth-degree representation (NDDR) has achieved relevant results for direct spanning tree representation together with evolutionary algorithms (EAs). Its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7d9456462dc52896d796e0e7d1ec2fc
https://doi.org/10.1109/tevc.2019.2928991
https://doi.org/10.1109/tevc.2019.2928991
Autor:
Candido F. X. de Mendonça, Celina M. H. de Figueiredo, Luerbio Faria, Letícia Rodrigues Bueno, Rodrigo de A. Hausen
Publikováno v:
Electronic Notes in Discrete Mathematics. 37:291-296
The Kneser graph K ( n , k ) has all k-subsets of an n-set as its vertices and two subsets are adjacent if they are disjoint. Lovasz conjectured that every connected vertex-transitive graph has a hamiltonian path. For n ⩾ 2 k + 1 , the Kneser graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b12ac6d85daf3e58683bb6b4bf7648c
https://doi.org/10.1016/j.endm.2011.05.050
https://doi.org/10.1016/j.endm.2011.05.050
Autor:
Peter Horak, Letícia Rodrigues Bueno
Publikováno v:
Journal of Graph Theory. 68:177-188
The Kneser graph K(n, k) has as its vertex set all k-subsets of an n-set and two k-subsets are adjacent if they are disjoint. The odd graph Ok is a special case of Kneser graph when n = 2k + 1. A long standing conjecture claims that Ok is hamiltonian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::190831775ba05cb2ae791d259076c0f7
https://doi.org/10.1002/jgt.20550
https://doi.org/10.1002/jgt.20550
Publikováno v:
Applicable Analysis and Discrete Mathematics. 3:386-394
Lov?sz conjectured that every connected vertex-transitive graph has a Hamiltonian path. The odd graphs Ok form a well-studied family of connected, k-regular, vertex-transitive graphs. It was previously known that Ok has Hamiltonian paths for k ? 14.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58755d340cafc351fd2f59ebe99fa51f
https://doi.org/10.2298/aadm0902386b
https://doi.org/10.2298/aadm0902386b
Publikováno v:
LATIN 2014: Theoretical Informatics ISBN: 9783642544224
LATIN
LATIN
The odd graph O k is the graph whose vertices are all subsets with k elements of a set {1,…,2k + 1}, and two vertices are joined by an edge if the corresponding pair of k-subsets is disjoint. A conjecture due to Biggs claims that O k is hamiltonian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2b5aa7175f047970c78e3902a1d87ef
https://doi.org/10.1007/978-3-642-54423-1_33
https://doi.org/10.1007/978-3-642-54423-1_33
