Browsing 2. Articole by Subject "join of graphs"

Now showing items 1-2 of 2

MAXIMUM NONTRIVIAL CONVEX COVER NUMBER OF JOIN AND CORONA OF GRAPHS

Buzatu, Radu (Institutul de Matematică şi Informatică al AŞM, 2021)

Let G be a connected graph. We say that 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. ...
MAXIMUM NONTRIVIAL CONVEX COVER NUMBER OF JOIN AND CORONA OF GRAPHS

Buzatu, Radu (2021)

Let G be a connected graph. We say that 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. ...

Now showing items 1-2 of 2

Search DSpace