Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Átila Arueira Jones"'
Publikováno v:
Discrete Applied Mathematics. 306:89-97
An edge clique partition of G is a set of edge-disjoint cliques of G which together contain every edge of G . In this work we investigate the computational complexity of determining the minimum size of an edge clique partition of G , denoted by c p (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89efa15287c60da2f6000fe503fc53ba
https://doi.org/10.1016/j.dam.2021.09.035
https://doi.org/10.1016/j.dam.2021.09.035
Publikováno v:
Applied Mathematics and Computation. 330:307-315
Let G be a simple graph and L = L ( G ) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89daa82cdf6e6aa79ee51efb32270db7
https://doi.org/10.1016/j.amc.2018.02.046
https://doi.org/10.1016/j.amc.2018.02.046
Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cographs with $n$ vertices, based on the generation of cotrees. The delay
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53af6639aaf3fb0b9cdb5c3c6e307d20
http://arxiv.org/abs/1612.05827
http://arxiv.org/abs/1612.05827
