| Articolul precedent |
| Articolul urmator |
 |
 199 4 |
| Ultima descărcare din IBN: 2023-12-05 10:23 |
 SM ISO690:2012BUZATU, Radu. Convex covering problem of graphs resulting from some graph operations. In: Conference on Applied and Industrial Mathematics: CAIM 2022, Ed. 29, 25-27 august 2022, Chişinău. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2022, Ediţia a 29, p. 107. ISBN 978-9975-81-074-6. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Applied and Industrial Mathematics Ediţia a 29, 2022 |
||||||
|
Conferința "Conference on Applied and Industrial Mathematics" 29, Chişinău, Moldova, 25-27 august 2022 | ||||||
|
||||||
| Pag. 107-107 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We present new findings related to the convex covering problem of graphs resulting from some graph operations. Convex covers of graphs are defined in [1]. In general, convex covering problem of graphs is NP-complete [2]. So, it is of interest to investigate this problem for graphs resulting from different graph operations. We determine the maximum nontrivial convex cover number of the join and corona of graphs. These results are partially presented in [3]. |
||||||
|
|
|
|
