Macarena Trigo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Macarena Trigo has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Luis Medina
Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Av. Angamos 601, Antofagasta 1240000, Chile
5 shared publications - Jonnathan Rodríguez
Universidad de Antofagasta
2 shared publications - Hans Nina
Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Antofagasta 1240000, Chile
1 shared publication
Latest Publications
- Open Access
- 24 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (17) , 2720
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new spectral results for the reciprocal distance signless Laplacian matrix. In particular, we identify a sequence of graphs whose eigenvalues are all integers. Furthermore, we introduce the concept of Harary incidence energy and extend known incidence energy results to the setting of the reciprocal distance signless Laplacian matrix. Finally, we characterize the Harary incidence energy of extremal graphs by examining vertex connectivity through the generalized graph join operation.
- 24 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (17) , 2720
Open AccessSpectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new spectral results for the reciprocal distance signless Laplacian matrix. In particular, we identify a sequence of graphs whose eigenvalues are all integers. Furthermore, we introduce the concept of Harary incidence energy and extend known incidence energy results to the setting of the reciprocal distance signless Laplacian matrix. Finally, we characterize the Harary incidence energy of extremal graphs by examining vertex connectivity through the generalized graph join operation.
- Open Access
- 19 December 2023
- Published by MDPI AG in Mathematics
- Vol. 12 (1) , 2
New Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction
In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this regard. Furthermore, by employing matrix order reduction techniques, we derive upper and lower bounds utilizing existing graph invariants and vertex connectivity. Finally, we characterize the graphs that achieve the aforementioned bounds by considering the generalized join operation of graphs.
- 19 December 2023
- Published by MDPI AG in Mathematics
- Vol. 12 (1) , 2
Open AccessNew Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction
In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this regard. Furthermore, by employing matrix order reduction techniques, we derive upper and lower bounds utilizing existing graph invariants and vertex connectivity. Finally, we characterize the graphs that achieve the aforementioned bounds by considering the generalized join operation of graphs.
- Open Access
- 1 November 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2090 (1) , 012103
Spectral radius of the Harary matrix of the join product of regular graphs1
The distance between two vertices is equal to the number of edges on the shortest path connecting them. The Harary matrix of a simple, undirected, connected and unweighted graph of n vertices is an nonnegative matrix of order n, such that the (i, j)-entry is equal to the reciprocal distance between the vertices vi and Vj if the vertices are different and zero if are equal. In this work we found bounds for the spectral radius of the Harary matrix of the join product of regular graphs.
- 1 November 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2090 (1) , 012103
Open AccessSpectral radius of the Harary matrix of the join product of regular graphs1
The distance between two vertices is equal to the number of edges on the shortest path connecting them. The Harary matrix of a simple, undirected, connected and unweighted graph of n vertices is an nonnegative matrix of order n, such that the (i, j)-entry is equal to the reciprocal distance between the vertices vi and Vj if the vertices are different and zero if are equal. In this work we found bounds for the spectral radius of the Harary matrix of the join product of regular graphs.
- 30 September 2020
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 70 (16) , 3097-3118
Bounds on the Reciprocal distance energy and Reciprocal distance Laplacian energies of a graph
Let G be a simple undirected connected graph. In this article, we find bounds on the Reciprocal Distance Energy, Reciprocal Distance Laplacian Energy and Reciprocal Distance signless Laplacian Energy. Furthermore, we characterized the graphs that attained some of those bounds.
- 30 September 2020
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 70 (16) , 3097-3118
Bounds on the Reciprocal distance energy and Reciprocal distance Laplacian energies of a graph
Let G be a simple undirected connected graph. In this article, we find bounds on the Reciprocal Distance Energy, Reciprocal Distance Laplacian Energy and Reciprocal Distance signless Laplacian Energy. Furthermore, we characterized the graphs that attained some of those bounds.
- Open Access
- 14 May 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (5) , 792
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph. The graphs for which those bounds are attained are characterized.
- 14 May 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (5) , 792
Open AccessOn Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph. The graphs for which those bounds are attained are characterized.