Navegação Ciências Exatas e da Terra por Assunto "Grafos"
Resultados 1-8 de 8
-
Counting orientations of graphs with no strongly connected tournaments
(2021) [Artigo de periódico]Let Sk(n) be the maximum number of orientations of an n-vertex graph G in which no copy of Kk is strongly connected. For all integers n, k ≥ 4 where n ≥ 5 or k ≥ 5, we prove that Sk(n) = 2tk - 1(n), where tk-1(n) is the ... -
From UML to Simulink CAAM : formal specification and transformation analysis
(2013) [Artigo de periódico]UML and Simulink are attractive languages for embedded systems design and modeling. An automatic mapping from UML models to Simulink would be an interesting resource in a seamless design flow, allowing designers to use UML ... -
Gallai-Edmonds decomposition of unicyclic graphs from null space
(2022) [Artigo de periódico]In this paper, we compute the Gallai-Edmonds decomposition of a unicyclic graph G using linear algebraic tools. More precisely, the Gallai-Edmonds decomposition of G is obtained from the null space associated with adjacency ... -
Locating eigenvalues of a symmetric matrix whose graph is unicyclic
(2021) [Artigo de periódico]We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic. The algorithm can be applied to vertex- and/or edge-weighted ... -
Locating eigenvalues of symmetric matrices - a survey
(2024) [Artigo de periódico]We survey algorithms for locating eigenvalues of symmetric matrices taking advantage of the underlying graph. We present applications in spectral graph theory. -
Maximum number of r-edge-colorings such that all copies of Kk are rainbow
(2021) [Artigo de periódico]We consider a version of the Erdős-Rothschild problem for families of graph patterns. For any fixed k ≥ 3, let r0(k) be the largest integer such that the following holds for all 2 ≤ r ≤ r0(k) and all sufficiently large n: ... -
Partial characterization of graphs having a single large Laplacian eigenvalue
(2018) [Artigo de periódico]The parameter (G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal to the average degree of G. In this work, we address the problem of characterizing those graphs G having (G) = 1. Our ... -
Planejamento, execução e reflexão a partir de uma abordagem inicial sobre Grafos na EJA : uma experiência de transposição didática com a atividade “Cama de Grafos”
(2019) [Artigo de periódico]O artigo pretende explorar e refletir sobre as formas com as quais foi produzida e realizada uma atividade numa disciplina de graduação do curso de Licenciatura em Matemática na Universidade Federal do Rio Grande do Sul, ...