María Robbiano
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
María Robbiano has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Enide Andrade
University of Aveiro
17 shared publications - Eber Lenes
Universidad del Sinu, Cartagena, Colombia
6 shared publications - Cristina Manzaneda
Departamento de Matemáticas, Facultad de Ciencias, Universidad Católica del Norte, Antofagasta, Chile
5 shared publications - Jonnathan Rodríguez
Univ Antofagasta, Dept Matemat, Av Angamos 601, Antofagasta, Chile
3 shared publications - Jonnathan Rodríguez
Universidad de Antofagasta
3 shared publications - Bernardo San Martín
Universidad Católica del Norte
2 shared publications
Latest Publications
- 26 October 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Bounds on α-distance Randić Estrada index
In this paper, for a simple undirected connected graph [Formula: see text] and [Formula: see text], the concept of [Formula: see text]-distance Randić Estrada index of [Formula: see text] is studied. The notion of [Formula: see text]-distance Randić energy of [Formula: see text] is also investigated. Sharp lower and upper bounds for the [Formula: see text]-distance Randić Estrada index are obtained, and the extremal graphs are characterized. Additionally, a relation between the [Formula: see text]-distance Randić Estrada index and the [Formula: see text]-distance Randić energy of graphs is achieved. Moreover, a bound for the subdominant eigenvalues (eigenvalues different from the Perron value) of the [Formula: see text]-distance Randić matrix is presented.
- 26 October 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Bounds on α-distance Randić Estrada index
In this paper, for a simple undirected connected graph [Formula: see text] and [Formula: see text], the concept of [Formula: see text]-distance Randić Estrada index of [Formula: see text] is studied. The notion of [Formula: see text]-distance Randić energy of [Formula: see text] is also investigated. Sharp lower and upper bounds for the [Formula: see text]-distance Randić Estrada index are obtained, and the extremal graphs are characterized. Additionally, a relation between the [Formula: see text]-distance Randić Estrada index and the [Formula: see text]-distance Randić energy of graphs is achieved. Moreover, a bound for the subdominant eigenvalues (eigenvalues different from the Perron value) of the [Formula: see text]-distance Randić matrix is presented.
- Open Access
- 1 September 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 3 (97) , 1177
The ABC Spectrum of Caterpillars and Applications
- 1 September 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 3 (97) , 1177
Open AccessThe ABC Spectrum of Caterpillars and Applications
- 2 July 2026
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 74 (10) , 1-32
Main eigenvalues for normal matrices and mixed graphs
- 2 July 2026
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 74 (10) , 1-32
Main eigenvalues for normal matrices and mixed graphs
- Open Access
- 26 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1769
On the Spectral Radius of the Maximum Degree Matrix of Graphs
Let G be a graph with n vertices, and let denote the degree of vertex u in The maximum degree matrix of G is the square matrix of order n whose -entry is equal to if vertices u and v are adjacent in G, and zero otherwise. Let be the graph obtained from the complete graph by removing an edge , and identifying vertices u and v with the end vertices and of the paths and , respectively. Let denote the set of simple, connected graphs with n vertices and diameter d. A graph in that attains the largest spectral radius of the maximum degree matrix is called a maximizing graph. In this paper, we first characterize the spectrum of the maximum degree matrix for graphs of the form , where . Furthermore, for we prove that the maximizing graph in is Finally, if is an even integer, then the spectral radius of the maximum degree matrix in can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order .- 26 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1769
Open AccessOn the Spectral Radius of the Maximum Degree Matrix of Graphs
Let G be a graph with n vertices, and let denote the degree of vertex u in The maximum degree matrix of G is the square matrix of order n whose -entry is equal to if vertices u and v are adjacent in G, and zero otherwise. Let be the graph obtained from the complete graph by removing an edge , and identifying vertices u and v with the end vertices and of the paths and , respectively. Let denote the set of simple, connected graphs with n vertices and diameter d. A graph in that attains the largest spectral radius of the maximum degree matrix is called a maximizing graph. In this paper, we first characterize the spectrum of the maximum degree matrix for graphs of the form , where . Furthermore, for we prove that the maximizing graph in is Finally, if is an even integer, then the spectral radius of the maximum degree matrix in can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order . - 28 October 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (1) , 1-19
The largest ABC eigenvalue and the ABC energy of generalized Bethe trees
- 28 October 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (1) , 1-19
The largest ABC eigenvalue and the ABC energy of generalized Bethe trees
- Open Access
- 1 September 2024
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 11 (3) , 189-206
On energies of graphs with given independence number and families of hyperenergetic graphs
Let $G$ be a simple graph of order $n$ and $\mathscr{L}(G) \equiv \mathscr{L}^{1}(G)$ its line graph. Then, the iterated line graph of $G$ is defined recursively as $\mathscr{L}^{2}(G) \equiv \mathscr{L}(\mathscr{L}(G)), \mathscr{L}^{3}(G)\equiv \mathscr{L}(\mathscr{L}^{2}(G)), \ldots, \mathscr{L}^{k}(G)\equiv\mathscr{L}\left(\mathscr{L}^{k-1}(G)\right).$ The energy $\mathcal{E}(G)$ is the sum of absolute values of the eigenvalues of $G$. In this paper, it is derived a sharp upper bound for the energy of the line graph of a connected graph $G$ of order $n$ and independence number not less than $\alpha$ where $1\leq\alpha\leq n-2$. This bound is attained, if and only if, $G$ is isomorphic to the complete split graphs $SK_{n,\alpha}$. It is also determined a lower bound for the energy of the line graph of a graph $G$ of order $n$ and independence number $\alpha$. For $1\leq\alpha\leq n-1$ and $\mathcal{H}=\left(n-\alpha\left\lfloor\dfrac{n}{\alpha}\right\rfloor\right)K_{\lfloor\frac{n}{\alpha}\rfloor+1}\bigcup \left(\alpha+\alpha\left\lfloor\dfrac{n}{\alpha}\right\rfloor-n\right)K_{\lfloor\frac{n}{\alpha}\rfloor}$, the equality holds, if and only if $G \cong \mathcal{H}.$ As a consequence, families of hyperenergetic graphs are determined. Also, a lower bound for the energy of the iterated line of a graph $G$ of order $n$ and independence number $\alpha$ is given and, for $1\leq\alpha\leq n-1$, the equality holds, if and only if, $G\cong \alpha K_{\left\lfloor\frac{n}{\alpha}\right\rfloor}$. Additionally, an upper bound for the incidence energy of connected graphs $G$ of order $n$ and independence number not less than $\alpha$ is presented. Moreover, an upper bound on the Laplacian energy-like of the complement $\overline{G}$ of $G$ is presented. For $1\leq\alpha\leq n-1$, the bound is attained, if and only if, $G\cong \mathcal{H}.$ Finally, a Nordhaus-Gaddum type relation is given.- 1 September 2024
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 11 (3) , 189-206
Open AccessOn energies of graphs with given independence number and families of hyperenergetic graphs
Let $G$ be a simple graph of order $n$ and $\mathscr{L}(G) \equiv \mathscr{L}^{1}(G)$ its line graph. Then, the iterated line graph of $G$ is defined recursively as $\mathscr{L}^{2}(G) \equiv \mathscr{L}(\mathscr{L}(G)), \mathscr{L}^{3}(G)\equiv \mathscr{L}(\mathscr{L}^{2}(G)), \ldots, \mathscr{L}^{k}(G)\equiv\mathscr{L}\left(\mathscr{L}^{k-1}(G)\right).$ The energy $\mathcal{E}(G)$ is the sum of absolute values of the eigenvalues of $G$. In this paper, it is derived a sharp upper bound for the energy of the line graph of a connected graph $G$ of order $n$ and independence number not less than $\alpha$ where $1\leq\alpha\leq n-2$. This bound is attained, if and only if, $G$ is isomorphic to the complete split graphs $SK_{n,\alpha}$. It is also determined a lower bound for the energy of the line graph of a graph $G$ of order $n$ and independence number $\alpha$. For $1\leq\alpha\leq n-1$ and $\mathcal{H}=\left(n-\alpha\left\lfloor\dfrac{n}{\alpha}\right\rfloor\right)K_{\lfloor\frac{n}{\alpha}\rfloor+1}\bigcup \left(\alpha+\alpha\left\lfloor\dfrac{n}{\alpha}\right\rfloor-n\right)K_{\lfloor\frac{n}{\alpha}\rfloor}$, the equality holds, if and only if $G \cong \mathcal{H}.$ As a consequence, families of hyperenergetic graphs are determined. Also, a lower bound for the energy of the iterated line of a graph $G$ of order $n$ and independence number $\alpha$ is given and, for $1\leq\alpha\leq n-1$, the equality holds, if and only if, $G\cong \alpha K_{\left\lfloor\frac{n}{\alpha}\right\rfloor}$. Additionally, an upper bound for the incidence energy of connected graphs $G$ of order $n$ and independence number not less than $\alpha$ is presented. Moreover, an upper bound on the Laplacian energy-like of the complement $\overline{G}$ of $G$ is presented. For $1\leq\alpha\leq n-1$, the bound is attained, if and only if, $G\cong \mathcal{H}.$ Finally, a Nordhaus-Gaddum type relation is given. - 1 April 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 590, 1-21
On the spectra of some g-circulant matrices and applications to nonnegative inverse eigenvalue problem
- 1 April 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 590, 1-21
On the spectra of some g-circulant matrices and applications to nonnegative inverse eigenvalue problem
- Open Access
On the spectra of $g$-circulant matrices and applications
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it is shown that spectra with sufficient conditions so that it can be the spectrum of a real g-circulant matrix is not a spectrum with sufficient conditions so that it can be the spectrum of a real circulant matrix of the same order. The obtained results are applied to Nonnegative Inverse Eigenvalue Problem to construct nonnegative, g-circulant matrices with given appropriated spectrum. Moreover, nonnegative g-circulant matrices by blocks are also studied and in this case, their orders can be a multiple of a prime number.
Open AccessOn the spectra of $g$-circulant matrices and applications
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it is shown that spectra with sufficient conditions so that it can be the spectrum of a real g-circulant matrix is not a spectrum with sufficient conditions so that it can be the spectrum of a real circulant matrix of the same order. The obtained results are applied to Nonnegative Inverse Eigenvalue Problem to construct nonnegative, g-circulant matrices with given appropriated spectrum. Moreover, nonnegative g-circulant matrices by blocks are also studied and in this case, their orders can be a multiple of a prime number.
- Open Access
New lower bounds for the energy of matrices and graphs
Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound obtained by Mc Clellands for the energy of graphs in $1971$ to the case of Hermitian matrices and graphs with a given nullity. The second one generalizes a lower bound obtained by K. Das, S. A. Mojallal and I. Gutman in 2013 to symmetric non-negative matrices and graphs with a given nullity. The equality cases are discussed. These lower bounds are obtained for graphs with $m$ edges and some examples are provided showing that, some obtained bounds are incomparable with the known lower bound for the energy $2\sqrt{m}$. Another family of lower bounds are obtained from an increasing sequence of lower bounds for the spectral radius of a graph. The bounds are stated for singular and non-singular graphs.Open AccessNew lower bounds for the energy of matrices and graphs
Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound obtained by Mc Clellands for the energy of graphs in $1971$ to the case of Hermitian matrices and graphs with a given nullity. The second one generalizes a lower bound obtained by K. Das, S. A. Mojallal and I. Gutman in 2013 to symmetric non-negative matrices and graphs with a given nullity. The equality cases are discussed. These lower bounds are obtained for graphs with $m$ edges and some examples are provided showing that, some obtained bounds are incomparable with the known lower bound for the energy $2\sqrt{m}$. Another family of lower bounds are obtained from an increasing sequence of lower bounds for the spectral radius of a graph. The bounds are stated for singular and non-singular graphs. - 1 March 2019
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 564, 15-27
Guo's index for some classes of matrices
- 1 March 2019
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 564, 15-27
Guo's index for some classes of matrices