3 citations · 5 across the 6 of their papers we have counts for
5 papers · 1 filter
Corrections to classical results on Independence and Covering numbers of the Splitting graph
J. Castro, J. Leaños, O. Rosario
The splitting graph of a finite simple graph was introduced by Sampathkumar and Walikar in 1980~\cite{SW1980} and has been extensively studied in relation to graph invar…
Mathematical results on harmonic polynomials
Walter Carballosa, Juan E. Nápoles, J. M Rodríguez +2
Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index…
Optimal inequalities and extremal problems on the general Sombor index
J. C. Hernández, J. M. Rodríguez, O. Rosario +1
In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, we have inequalities for these indices relating them with other indices: the firs…
Distinguishing wheel graphs by the alliance polynomial
Walter Carballosa, Omar Rosario, José M. Sigarreta +1
Distinctive power of the alliance polynomial has been studied in previous works, for instance, it has been proved that the empty, path, cycle, complete, complete without one edge a…
Computing the strong alliance polynomial of a graph
Walter Carballosa, Juan Carlos Hernandez-Gomez, Omar Rosario +1
We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph with order n and strong defensive alliance number is the polynomial $a(…