Articolul precedent |
Articolul urmator |
476 3 |
Ultima descărcare din IBN: 2023-12-05 10:18 |
SM ISO690:2012 BUZATU, Radu. On the maximum nontrivial convex cover number of the join of graphs. In: Proceedings IMCS-55: The Fifth Conference of Mathematical Society of the Republic of Moldova, 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2019, pp. 183-186. ISBN 978-9975-68-378-4. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Proceedings IMCS-55 2019 | |||||
Conferința "Conference of Mathematical Society of the Republic of Moldova" Chișinău, Moldova, 28 septembrie - 1 octombrie 2019 | |||||
|
|||||
Pag. 183-186 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
Given a connected graph G, a set S ⊆ X(G) is convex in G if, for any two vertices x, y ∈ S, all vertices of every shortest path between x and y are in S. If 3 ≤ |S| ≤ |X(G)| − 1, then S is a nontrivial set. The greatest p ≥ 2 for which there is a cover of G by p nontrivial convex sets is the maximum nontrivial convex cover number of G. In this paper, we establish the maximum nontrivial convex cover number of the join of graphs. |
|||||
Cuvinte-cheie nontrivial convex cover, join of graphs |
|||||
|