Domingos Moreira Cardoso
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Domingos Moreira Cardoso has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Enide Andrade
University of Aveiro
13 shared publications Oscar Rojo
10 shared publications- Milica Anđelić
Kuwait University
6 shared publications - Jorge Orestes Cerdeira
Universidade Nova de Lisboa
5 shared publications Maria Robbiano
5 shared publications- Paula Carvalho
University of Aveiro
5 shared publications
Latest Publications
- Open Access
- 13 June 2023
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 58 (1) , 263-277
Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
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 deduced using edge clique partitions. As an application, we prove that the least eigenvalue of the n-Queens graph $${\mathcal {Q}}(n)$$ is equal to $$-4$$ for every $$n \ge 4$$ and it is also proven that the multiplicity of this eigenvalue is $$(n-3)^2$$ . Finally, edge clique partitions of additional infinite families of connected graphs and their relations with the least eigenvalues are presented.- 13 June 2023
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 58 (1) , 263-277
Open AccessSharp bounds on the least eigenvalue of a graph determined from edge clique partitions
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 deduced using edge clique partitions. As an application, we prove that the least eigenvalue of the n-Queens graph $${\mathcal {Q}}(n)$$ is equal to $$-4$$ for every $$n \ge 4$$ and it is also proven that the multiplicity of this eigenvalue is $$(n-3)^2$$ . Finally, edge clique partitions of additional infinite families of connected graphs and their relations with the least eigenvalues are presented. - Open Access
- 27 April 2022
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 648, 160-180
The H-join of arbitrary families of graphs - the universal adjacency spectrum
- 27 April 2022
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 648, 160-180
Open AccessThe H-join of arbitrary families of graphs - the universal adjacency spectrum
- 1 December 2021
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 87 (3) , 729-744
On the Randić energy of caterpillar graphs
- 1 December 2021
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 87 (3) , 729-744
On the Randić energy of caterpillar graphs
- 1 December 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (12)
The main vertices of a star set and related graph parameters
- 1 December 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (12)
The main vertices of a star set and related graph parameters
- Open Access
The main vertices of a star set and related graph parameters
A vertex $v \in V(G)$ is called $\lambda$-main if it belongs to a star set $X \subset V(G)$ of the eigenvalue $\lambda$ of a graph $G$ and this eigenvalue is main for the graph obtained from $G$ by deleting all the vertices in $X \setminus \{v\}$; otherwise, $v$ is $\lambda$-non-main. Some results concerning main and non-main vertices of an eigenvalue are deduced. For a main eigenvalue $\lambda$ of a graph $G$, we introduce the minimum and maximum number of $\lambda$-main vertices in some $\lambda$-star set of $G$ as new graph invariant parameters. The determination of these parameters is formulated as a combinatorial optimization problem based on a simplex-like approach. Using these and some related parameters we develop new spectral tools that can be used in the research of the isomorphism problem. Examples of graphs for which the maximum number of $\lambda$-main vertices coincides with the cardinality of a $\lambda$-star set are provided.Open AccessThe main vertices of a star set and related graph parameters
A vertex $v \in V(G)$ is called $\lambda$-main if it belongs to a star set $X \subset V(G)$ of the eigenvalue $\lambda$ of a graph $G$ and this eigenvalue is main for the graph obtained from $G$ by deleting all the vertices in $X \setminus \{v\}$; otherwise, $v$ is $\lambda$-non-main. Some results concerning main and non-main vertices of an eigenvalue are deduced. For a main eigenvalue $\lambda$ of a graph $G$, we introduce the minimum and maximum number of $\lambda$-main vertices in some $\lambda$-star set of $G$ as new graph invariant parameters. The determination of these parameters is formulated as a combinatorial optimization problem based on a simplex-like approach. Using these and some related parameters we develop new spectral tools that can be used in the research of the isomorphism problem. Examples of graphs for which the maximum number of $\lambda$-main vertices coincides with the cardinality of a $\lambda$-star set are provided. - Open Access
The H-join of arbitrary families of graphs
The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of $H$ by $G_i$ and adding to the edges of all graphs in $\mathcal{G}$ the edges of the join $G_i \vee G_j$, for every edge $ij$ of $H$. Some well known graph operations are particular cases of the $H$-join of a family of graphs $\mathcal{G}$ as it is the case of the lexicographic product (also called composition) of two graphs $H$ and $G$, $H[G]$. During long time the known expressions for the determination of the entire spectrum of the $H$-join in terms of the spectra of its components and an associated matrix were limited to families of regular graphs. In this work, we extend such a determination, as well as the determination of the characteristic polynomial, to families of arbitrary graphs. From the obtained results, the eigenvectors of the adjacency matrix of the $H$-join can also be determined in terms of the adjacency matrices of the components and an associated matrix.Open AccessThe H-join of arbitrary families of graphs
The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of $H$ by $G_i$ and adding to the edges of all graphs in $\mathcal{G}$ the edges of the join $G_i \vee G_j$, for every edge $ij$ of $H$. Some well known graph operations are particular cases of the $H$-join of a family of graphs $\mathcal{G}$ as it is the case of the lexicographic product (also called composition) of two graphs $H$ and $G$, $H[G]$. During long time the known expressions for the determination of the entire spectrum of the $H$-join in terms of the spectra of its components and an associated matrix were limited to families of regular graphs. In this work, we extend such a determination, as well as the determination of the characteristic polynomial, to families of arbitrary graphs. From the obtained results, the eigenvectors of the adjacency matrix of the $H$-join can also be determined in terms of the adjacency matrices of the components and an associated matrix. - Open Access
- 1 January 2020
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 40 (2) , 451-466
Graphs with clusters perturbed by regular graphs --- A_α-spectrum and applications
- 1 January 2020
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 40 (2) , 451-466
Open AccessGraphs with clusters perturbed by regular graphs --- A_α-spectrum and applications
- 1 November 2019
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 39 (1) , 12
Some new aspects of main eigenvalues of graphs
- 1 November 2019
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 39 (1) , 12
Some new aspects of main eigenvalues of graphs
- 1 September 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 269, 2-10
An overview of -regular sets and their applications- 1 September 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 269, 2-10
An overview of -regular sets and their applications- Open Access
- 1 January 2019
- Published by National Library of Serbia in Filomat
- Vol. 33 (19) , 6411-6423
Injective edge coloring of graphs
Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of lengths three. An injective edge coloring of a graph G = (V, E) is a coloring c of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then c(e1)? c(e3). The injective edge coloring number ?'i(G) is the minimum number of colors permitted in such a coloring. In this paper, exact values of ?'i(G) for several classes of graphs are obtained, upper and lower bounds for ?'i(G) are introduced and it is proven that checking whether ?'i(G) = k is NP-complete.
- 1 January 2019
- Published by National Library of Serbia in Filomat
- Vol. 33 (19) , 6411-6423
Open AccessInjective edge coloring of graphs
Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of lengths three. An injective edge coloring of a graph G = (V, E) is a coloring c of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then c(e1)? c(e3). The injective edge coloring number ?'i(G) is the minimum number of colors permitted in such a coloring. In this paper, exact values of ?'i(G) for several classes of graphs are obtained, upper and lower bounds for ?'i(G) are introduced and it is proven that checking whether ?'i(G) = k is NP-complete.