Bethe graphs attached to the vertices of a connected graph: a spectral approach

A weighted Bethe graph $B$ is obtained from a weighted generalized Bethe tree by identifying each set of children with the vertices of a graph belonging to a family $F$ of graphs. The operation of identifying the root vertex of each of $r$ weighted Bethe graphs to the vertices of a connected graph $\mathcal{R}$ of order $r$ is introduced as the $\mathcal{R}$-concatenation of a family of $r$ weighted Bethe graphs. It is shown that the Laplacian eigenvalues (when $F$ has arbitrary graphs) as well as the signless Laplacian and adjacency eigenvalues (when the graphs in $F$ are all regular) of the $\mathcal{R}$-concatenation of a family of weighted Bethe graphs can be computed (in a unified way) using the stable and low computational cost methods available for the determination of the eigenvalues of symmetric tridiagonal matrices. Unlike the previous results already obtained on this topic, the more general context of families of distinct weighted Bethe graphs is herein considered.

Using GeoGebra to study complex functions

The aim of this workshop to present some of the strategies studied to use GeoGebra in the analysis of complex functions. The proposed tasks focus on complex analysis topics target for students of the 1st year of higher education, which can be easily adapted to pre-university students. In the first part of this workshop we will illustrate how to use the two graphical windows of GeoGebra to represent complex functions of complex variable. The second part will present the use of the dynamic color Geogebra in order to obtain Coloring domains that correspond to the graphic representation of complex functions. Finally, we will use the threedimensional graphics window in GeoGebra to study the component functions of a complex function. During the workshop will be provided scripts orientation of the different tasks proposed to be held on computers with Geogebra version 5.0 or high.