8 citations · 17 across the 12 of their papers we have counts for
15 papers · 1 filter
Integer eigenvalues of the -Queens graph
Domingos M. Cardoso, Inês Serôdio Costa, Rui Duarte
The -Queens graph, , is the graph obtained from a chessboard where each of its squares is a vertex and two vertices are adjacent if and only if…
Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
Domingos M. Cardoso, Inês Serôdio Costa, Rui Duarte
Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduc…
On the Randić energy of caterpillar graphs
Domingos M. Cardoso, Paula Carvalho, Roberto C. Díaz +1
A caterpillar graph of order , , is a tree such that removing all its pendent vertices gives rise to a path of order . In t…
The H-join of arbitrary families of graphs
Domingos M. Cardoso, Helena Gomes, Sofia J. Pinheiro
The -join of a family of graphs , also called the generalized composition, , where all graphs are undirected, simple and fin…
Spectral properties of the -Queens' Graphs
Domingos M. Cardoso, Inês Serôdio Costa, Rui Duarte
The -Queens' graph, , is the graph associated to the chessboard (a generalization of the classical chessboard), with vertices, ea…
The main vertices of a star set and related graph parameters
Milica Anđelić, Domingos M. Cardoso, Slobodan K. Simi\' c +1
A vertex is called -main if it belongs to a star set of the eigenvalue of a graph and this eigenvalue is main for the graph obtained from $…
An overview of -regular sets and their applications
Domingos M. Cardoso
A (,)-regular set is a vertex subset S inducing a -regular subgraph such that every vertex out of S has neighbors in S. This article is an expository overview of the m…
A survey on graphs with convex quadratic stability number
Domingos M. Cardoso
A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a conv…
Laplacian Distribution and Domination
Domingos M. Cardoso, David P. Jacobs, Vilmar Trevisan
Let denote the number of Laplacian eigenvalues of a graph in an interval , and let denote its domination number. We extend the recent result $m_G[0,1) \leq γ…
On main eigenvalues of certain graphs
Nair Abreu, Domingos M. Cardoso, Francisca A. M. França +1
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main ei…
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
Nair Abreu, Domingos M. Cardoso, Paula Carvalho +1
Consider two graphs and . Let be the lexicographic product of and , where is the lexicographic product of the graph by itself times. In this…
Injective Edge Chromatic Index of a Graph
Domingos M. Cardoso, J. Orestes Cerdeira, J. Pedro Cruz +1
Three edges and in a graph are consecutive if they form a path (in this order) or a cycle of length three. An injective edge coloring of a graph $G = (V,…
Spectral results for the dominating induced matching problem
Domingos M. Cardoso, Enide A. Martins, Luís Medina +1
A matching M is a dominating induced matching of a graph, if every edge of the graph is either in or has a common end-vertex with exactly one edge in . The concept of comple…
On the characteristic polynomial of Laplacian Matrices of Caterpillars
D. M. Cardoso, M. A. A. de Freitas, E. A. Martins +2
The characteristic polynomials of the adjacency matrix of line graphs of caterpillars and then the characteristic polynomials of their Laplacian or signless Laplacian matrices are…
Eigenvalues of a H-generalized join graph operation constrained by vertex subsets
Domingos M. Cardoso, Enide A. Martins, Maria Robbiano +1
Considering a graph of order , a generalized -join operation of a family of graphs , constrained by a family of vertex subsets , $i=1,…