24 citations · 35 across the 12 of their papers we have counts for
4 papers · 1 filter
L-Borderenergetic graphs and Normalized Laplacian Energy
Fernando Tura
In this paper we present new L-borderenergetic graphs, this is, graphs which are L-noncospectral with Kn but have the same Laplacian energy. We also present some graphs which are n…
Eigenvalue location in cographs
David P. Jacobs, Vilmar Trevisan, Fernando C. Tura
We give an time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and . Applications in…
Counting Spanning trees in double nested graphs
Fernando Tura
In this paper we give a linear time algorithm for computing the number of spanninig trees in double nested graphs.
L-Borderenergetic graphs
Fernando Tura
The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A graph G on n vertices is said to be borderenergetic if its energy equa…